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:T5a7,/* generator code */ #include "testlib.h" #include #include #include using namespace std; int main(int argc, char* argv[]) { registerGen(argc, argv, 1); // Small sizes hand-checkable int N = rnd.next(1, 10); int M = rnd.wnext(20, -1) + 1; // bias towards smaller M // Generate unique number cards set cardSet; vector cards; while ((int)cards.size() < N) { int x = rnd.next(-10000000, 10000000); if (cardSet.insert(x).second) { cards.push_back(x); } } shuffle(cards.begin(), cards.end()); // Probability to pick an existing card in queries double existProb = rnd.next(0.0, 1.0); // Generate queries vector queries; for (int i = 0; i < M; i++) { if (!cards.empty() && rnd.next() < existProb) { // pick an existing card queries.push_back(rnd.any(cards)); } else { // pick a non-existing integer int y; do { y = rnd.next(-10000000, 10000000); } while (cardSet.count(y)); queries.push_back(y); } } // Output in required format println(N); for (int i = 0; i < N; i++) { printf("%d%c", cards[i], i + 1 == N ? '\n' : ' '); } println(M); for (int i = 0; i < M; i++) { printf("%d%c", queries[i], i + 1 == M ? '\n' : ' '); } return 0; } 5:["$","div"

코드 #2419