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:T76f,#include "testlib.h" #include using namespace std; int n; vector mat; // Read and validate one answer (either jury's or participant's). // On error, quits with _fail if stream==ans, or _wa if stream==ouf. vector readAns(InStream &stream) { // Compute required chain length K = 1 + floor(log2(n)) int K = 1; while ((1 << K) <= n) ++K; vector chain(K); for (int i = 0; i < K; i++) { char buf[30]; sprintf(buf, "chain[%d]", i + 1); chain[i] = stream.readInt(1, n, buf); } // Check all distinct vector used(n + 1, false); for (int i = 0; i < K; i++) { int v = chain[i]; if (used[v]) { stream.quitf(_wa, "student %d appears more than once in the chain", v); } used[v] = true; } // Check ordering: for all i

코드 #5806