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:T653,#include "testlib.h" #include #include using namespace std; int main(int argc, char* argv[]) { registerGen(argc, argv, 1); // Precompute small primes up to 100 vector primes; vector isprime(201, true); isprime[0] = isprime[1] = false; for (int i = 2; i <= 200; i++) { if (isprime[i]) { if (i <= 100) primes.push_back(i); if (1LL * i * i <= 200) for (int j = i * i; j <= 200; j += i) isprime[j] = false; } } int T = rnd.next(2, 7); println(T); for (int t = 0; t < T; t++) { int M; vector a; if (t == 0) { // All-equal case M = rnd.next(2, 5); int x = rnd.next(1, 100); a.assign(M, x); } else { M = rnd.next(2, 12); int type = rnd.next(1, 3); if (type == 1) { // All primes (likely coprime) for (int i = 0; i < M; i++) a.push_back(rnd.any(primes)); } else if (type == 2) { // Heavy duplicates int x = rnd.next(1, 100); int dup = rnd.next(1, M - 1); for (int i = 0; i < dup; i++) a.push_back(x); for (int i = dup; i < M; i++) a.push_back(rnd.next(1, 100)); } else { // Fully random for (int i = 0; i < M

코드 #6285