19:I[10086,["6079","static/chunks/363642f4-4672ca396f99db0d.js","5653","static/chunks/5653-e83dcf6c883f2fed.js","1394","static/chunks/1394-5772593fb24fe823.js","7412","static/chunks/7412-44bfc7df6d166700.js","2298","static/chunks/2298-6fcb566ac5ccd13f.js","643","static/chunks/app/codes/%5Bid%5D/page-38137606830fba89.js"],"AdSenseInsert"] 1a:I[48803,["6079","static/chunks/363642f4-4672ca396f99db0d.js","5653","static/chunks/5653-e83dcf6c883f2fed.js","1394","static/chunks/1394-5772593fb24fe823.js","7412","static/chunks/7412-44bfc7df6d166700.js","2298","static/chunks/2298-6fcb566ac5ccd13f.js","643","static/chunks/app/codes/%5Bid%5D/page-38137606830fba89.js"],"CodeViewer"] 1b:T5af,#include "testlib.h" #include #include using namespace std; int generate_int_biased(int min, int max, vector thresholds) { int sz = thresholds.size(); int c = rnd.next(1, sz+1); if(c == 1) { return rnd.next(min, thresholds[0]); } else if(c == sz+1) { return rnd.next(thresholds[sz-1]+1, max); } else { return rnd.next(thresholds[c-2]+1, thresholds[c-1]); } } vector generate_vec(int len_min, int len_max, int elem_min, int elem_max) { int N = rnd.next(len_min, len_max); vector v; for (int i = 0; i < N; i++) { v.push_back(rnd.next(elem_min, elem_max)); } return v; } int main(int argc, char* argv[]) { registerGen(argc, argv, 1); while(1) { int K = rnd.next(1, 8), N = rnd.next(1, 15); while(!(K <= N)) { K = rnd.next(1, 8); N = rnd.next(1, 15); } int mn = rnd.next(1, 15); int mx = rnd.next(mn, mn+15); if(rnd.next() < 0.2) { // try very large mn, mx: close to INT_MAX mn = rnd.next(INT_MAX-10, INT_MAX); mx = rnd.next(mn, INT_MAX); } vector v = generate_vec(K, K, mn, mx); long long sum = accumulate(v.begin(), v.end(), 0ll); if(sum < N) { continue; } println(K, N); for(

코드 #214