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:T60c,#include "testlib.h" #include #include #include using namespace std; int main(int argc, char* argv[]) { registerGen(argc, argv, 1); int C = 1; println(C); for (int tc = 0; tc < C; tc++) { // Create a guaranteed perfect matching vector perm(11); iota(perm.begin(), perm.end(), 1); shuffle(perm.begin(), perm.end()); vector> s(11, vector(11, 0)); for (int i = 0; i < 11; i++) { int matched = perm[i] - 1; // Decide number of valid positions for player i int k; if (rnd.next() < 0.5) { k = rnd.next(1, 3); } else { k = rnd.next(2, 5); } // Always include the matched position vector avail; for (int j = 0; j < 11; j++) if (j != matched) avail.push_back(j); shuffle(avail.begin(), avail.end()); vector pos; pos.push_back(matched); for (int t = 0; t < k-1 && t < (int)avail.size(); t++) { pos.push_back(avail[t]); } // Assign abilities for (int j : pos) { if (j == matched) { s[i][j] = rnd.next(50, 100); } else { s[i][j] = rnd.next(1, 49); } } } // Output this test case

코드 #3509