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:T70c,#include "testlib.h" #include #include using namespace std; int main(int argc, char* argv[]) { registerGen(argc, argv, 1); // Choose N small enough for manual verification int N = rnd.next(1, 12); bool unsolvable = (N >= 3) && (rnd.next() < 0.3); vector> shirts; if (unsolvable) { // Force an impossible case: more shirts than distinct numbers N = rnd.next(3, 6); int x = rnd.next(1, 5); int y; do { y = rnd.next(1, 5); } while (y == x); for (int i = 0; i < N; i++) { int a = x, b = y; if (rnd.next() < 0.5) swap(a, b); shirts.emplace_back(a, b); } } else { // Construct a solvable case by ensuring a perfect matching int maxNum = rnd.next(N, N * 2 + 1); vector pool; for (int i = 1; i <= maxNum; i++) pool.push_back(i); shuffle(pool.begin(), pool.end()); vector primary(pool.begin(), pool.begin() + N); for (int i = 0; i < N; i++) { int a = primary[i]; int b; double p = rnd.next(); if (p < 0.4) { // same number on both sides b = a; } else if (p < 0.7) { // pick another primary to create collisions b = rnd.any(primary); } else { // pick any number

코드 #6019