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:T6cd,#include "testlib.h" #include #include #include using namespace std; int main(int argc, char* argv[]) { registerGen(argc, argv, 1); // Choose N up to 30 for hand-verifiable size int N = rnd.next(1, 30); int mode = rnd.next(0, 2); // 0: no valid window, 1: general, 2: exactly K ones int K; vector a(N, 2); if (mode == 0) { // Guarantee no valid window: total ones < K K = rnd.next(1, N); int cnt = (K > 1 ? rnd.next(0, K - 1) : 0); vector idx(N); iota(idx.begin(), idx.end(), 0); shuffle(idx.begin(), idx.end()); for (int i = 0; i < cnt; i++) { a[idx[i]] = 1; } } else if (mode == 2) { // Exactly K ones in total K = rnd.next(1, N); int cnt = K; vector idx(N); iota(idx.begin(), idx.end(), 0); shuffle(idx.begin(), idx.end()); for (int i = 0; i < cnt; i++) { a[idx[i]] = 1; } } else { // General case: total ones >= K K = rnd.next(1, N); int cnt = rnd.next(K, N); bool cluster = rnd.next(0, 1) == 0; if (cluster) { // Place ones in one contiguous block int start = rnd.next(0, N - cnt); for (int i = start; i < start + cnt; i++) { a[i] = 1; } } else { // Spread ones randomly ve

코드 #6331