1a:I[10086,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","643","static/chunks/app/codes/%5Bid%5D/page-56c854ce831bc98e.js"],"AdSenseInsert"] 1b:I[48803,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","643","static/chunks/app/codes/%5Bid%5D/page-56c854ce831bc98e.js"],"CodeViewer"] 1c:T6ae,#include "testlib.h" #include #include #include using namespace std; int main(int argc, char* argv[]) { registerGen(argc, argv, 1); // Choose small N but mix perfect squares and non-squares vector squares = {1, 4, 9}; vector nonsq = {2, 3, 5, 6, 7, 8, 10}; int N; if (rnd.next() < 0.5) { N = rnd.any(squares); } else { N = rnd.any(nonsq); } // Compute block size K and blocks int K = floor(sqrt(N)); if (K < 1) K = 1; int block_cnt = (N + K - 1) / K; vector> blocks; for (int i = 0; i < block_cnt; i++) { int l = i * K + 1; int r = min(N, (i + 1) * K); blocks.emplace_back(l, r); } // Number of days M int M = rnd.next(1, 20); // Output header println(N, M); // Generate each day's feeding for (int day = 0; day < M; day++) { double p = rnd.next(); int S, A; // 20%: span multiple full blocks if (p < 0.2 && block_cnt >= 2) { int b1 = rnd.next(0, block_cnt - 2); int b2 = rnd.next(b1, block_cnt - 1); A = blocks[b1].first; S = blocks[b2].second - blocks[b1].first + 1; } // 30%: align to exactly one block else if (p < 0.5 && block_cnt >= 1) { int b = rnd.next(0, block_cnt - 1); A = blocks[b].first; S = blocks[b].second - blocks[b].fi

코드 #3306