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:T528,#include "testlib.h" #include #include #include using namespace std; int main(int argc, char* argv[]) { registerGen(argc, argv, 1); // Number of cows int N = rnd.next(2, 10); // Domain size for flavor IDs: sometimes small, sometimes medium int maxF; if (rnd.next(0, 1) == 0) { // small domain to force many overlaps maxF = rnd.next(5, 20); } else { // larger domain for fewer overlaps maxF = rnd.next(20, 100); } // Probability to copy one flavor from a previous cow double pCopy = rnd.next(); vector> cows; cows.reserve(N); for (int i = 0; i < N; i++) { set s; // Optionally copy exactly one flavor from a random previous cow if (i > 0 && rnd.next() < pCopy) { int j = rnd.next(0, i - 1); int f = rnd.any(cows[j]); s.insert(f); } // Fill up to 5 distinct flavors while ((int)s.size() < 5) { s.insert(rnd.next(1, maxF)); } // Convert to vector and shuffle order vector v(s.begin(), s.end()); shuffle(v.begin(), v.end()); cows.push_back(v); } // Output println(N); for (auto &v : cows) { println(v); } return 0; }5:["$","div",null,{"className":"container mx-auto px-4","data-sentry-component":"CodePage","data-sentry-source-file":"page.tsx","children":

코드 #4631