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:T590,#include "testlib.h" #include #include #include using namespace std; int main(int argc, char* argv[]) { registerGen(argc, argv, 1); // Choose small N and valid K int N = rnd.next(3, 10); int K = rnd.next(0, N/2 - 1); // Decide distribution type int dist_type = rnd.next(0, 3); vector scores(N); if (dist_type == 0) { // Uniform distribution over [0,10] with one decimal for (int i = 0; i < N; i++) { scores[i] = rnd.next(0, 100); } } else if (dist_type == 1) { // Clustered low scores: take minimum of 3 samples for (int i = 0; i < N; i++) { scores[i] = rnd.wnext(101, -2); } } else if (dist_type == 2) { // Clustered high scores: take maximum of 3 samples for (int i = 0; i < N; i++) { scores[i] = rnd.wnext(101, 2); } } else { // Few repeated values int rep_cnt = rnd.next(1, min(N, 3)); vector base; for (int i = 0; i < rep_cnt; i++) { base.push_back(rnd.next(0, 100)); } for (int i = 0; i < N; i++) { scores[i] = rnd.any(base); } } // Shuffle so scores are in random order shuffle(scores.begin(), scores.end()); // Output println(N, K); for (int x : scores) { printf("%.1f\n", x / 10.0); } return 0; }5:["$","div",null,{"className":"con

코드 #3847