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:T7c5,#include "testlib.h" #include #include #include #include using namespace std; string randStr(int len) { string s; for (int i = 0; i < len; i++) s += char('a' + rnd.next(0, 25)); return s; } int main(int argc, char* argv[]) { registerGen(argc, argv, 1); // Number of test cases int T = rnd.next(1, 3); println(T); for (int tc = 0; tc < T; tc++) { // Number of clothes int n = rnd.next(0, 20); println(n); if (n == 0) continue; // Decide number of types (at least 1, up to min(n,10)), biased with wnext int hiTypes = min(n, 10); int w = rnd.next(-1, 1); int t = rnd.wnext(hiTypes, w) + 1; // in [1..hiTypes] // Distribute n items into t types (each gets at least 1) vector cnt(t, 1); int rem = n - t; for (int i = 0; i < rem; i++) { int idx = rnd.next(0, t - 1); cnt[idx]++; } // Generate unique type names vector types; set usedTypes; for (int i = 0; i < t; i++) { string s; do { s = randStr(rnd.next(3, 8)); } while (usedTypes.count(s)); usedTypes.insert(s); types.push_back(s); } // Generate items vector> items; set usedItems; for (int i = 0; i <

코드 #6205