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:T53e,#include "testlib.h" #include using namespace std; int main(int argc, char* argv[]) { registerGen(argc, argv, 1); // Hyper-parameter: number of sizes int m = rnd.next(1, 8); // Maximum extra disks above the mandatory one per size int rem_max = 20 - m; // Bias extra disks distribution for diversity int t = rnd.next(-2, 2); int rem = rnd.wnext(rem_max + 1, t); // rem in [0, rem_max] // Distribute extra disks randomly among sizes vector extra(m, 0); for (int i = 0; i < rem; i++) { int idx = rnd.next(0, m - 1); extra[idx]++; } vector k(m); for (int i = 0; i < m; i++) { k[i] = 1 + extra[i]; } // Assign colors, ensure at least one of each if possible vector color(m); if (m >= 3) { vector idx(m); iota(idx.begin(), idx.end(), 0); shuffle(idx.begin(), idx.end()); color[idx[0]] = 'R'; color[idx[1]] = 'G'; color[idx[2]] = 'B'; for (int i = 3; i < m; i++) { color[idx[i]] = rnd.any(string("RGB")); } } else { for (int i = 0; i < m; i++) { color[i] = rnd.any(string("RGB")); } } // Output println(m); for (int i = 0; i < m; i++) { println(color[i], k[i]); } return 0; }5:["$","div",null,{"className":"container mx-auto px-4","data-sentry-component":"CodePage","data-sentry-source-file":

코드 #5131