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:T5f7,#include "testlib.h" #include using namespace std; int main(int argc, char* argv[]) { registerGen(argc, argv, 1); // Size parameters int N = rnd.next(1, 10); // Bias K towards small or large splits for diversity int K; if (rnd.next() < 0.5) { // bias towards small K K = rnd.wnext(N, -1) + 1; } else { // bias towards large K K = rnd.wnext(N, 1) + 1; } // Hyper-parameters for sequence generation int maxBit = rnd.next(0, 29); // highest bit we may set double bitDensity = rnd.next(); // probability to set each bit double clusterProb = rnd.next(); // probability to repeat previous value // Generate sequence A with optional clustering vector A(N); for (int i = 0; i < N; i++) { if (i > 0 && rnd.next() < clusterProb) { // repeat previous for clustering A[i] = A[i - 1]; } else { int x = 0; for (int b = 0; b <= maxBit; b++) { if (rnd.next() < bitDensity) { x |= (1 << b); } } A[i] = x; } } // Ensure at least one non-zero to avoid trivial all-zero case bool anyNonZero = false; for (int x : A) if (x != 0) anyNonZero = true; if (!anyNonZero && N > 0) { int idx = rnd.next(0, N - 1); int b = rnd.next(0, maxBit); A[idx] |= (1 << b); }

코드 #4909