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:T73c,#include "testlib.h" #include #include #include #include using namespace std; int main(int argc, char* argv[]) { registerGen(argc, argv, 1); // Number of students: small for hand-check int N = rnd.next(8, 20); // Choose distribution type for diversity int distType = rnd.next(0, 3); vector scores; scores.reserve(N); if (distType == 0) { // Uniform distribution over [0, 100.000] for (int i = 0; i < N; i++) { scores.push_back(rnd.next(0, 100000)); } } else if (distType == 1) { // Clustered low: 70% in [0,20], others uniform for (int i = 0; i < N; i++) { if (rnd.next() < 0.7) scores.push_back(rnd.next(0, 20000)); else scores.push_back(rnd.next(0, 100000)); } } else if (distType == 2) { // Clustered high: 70% in [80,100], others uniform for (int i = 0; i < N; i++) { if (rnd.next() < 0.7) scores.push_back(rnd.next(80000, 100000)); else scores.push_back(rnd.next(0, 100000)); } } else { // Many duplicates: pick a small set of K distinct values int K = rnd.next(7, 10); set st; while ((int)st.size() < K) { st.insert(rnd.next(0, 100000)); } vector vals(st.begin(), st.end()); fo

코드 #4062