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:T5f4,#include "testlib.h" #include #include using namespace std; int main(int argc, char* argv[]) { registerGen(argc, argv, 1); // Choose N in three regimes: tiny, small, moderate double q = rnd.next(); int N; if (q < 0.2) { N = rnd.next(1, 5); } else if (q < 0.7) { N = rnd.next(6, 15); } else { N = rnd.next(16, 30); } // Pattern: 0=random, 1=sorted, 2=reverse sorted, 3=few unique duplicates int pattern = rnd.next(0, 3); // Choose maxVal to control duplication rate and value range double r = rnd.next(); int maxVal; if (r < 0.33) { maxVal = rnd.next(1, max(1, N)); } else if (r < 0.66) { maxVal = rnd.next(max(1, N), max(2, N * 3)); } else { maxVal = rnd.next(max(1, N * 3), 10000); } vector a(N); if (pattern == 3) { // Few unique values int K = rnd.next(1, min(N, 5)); vector uniq(K); for (int i = 0; i < K; i++) { uniq[i] = rnd.next(1, maxVal); } for (int i = 0; i < N; i++) { a[i] = rnd.any(uniq); } } else { // Random values for (int i = 0; i < N; i++) { a[i] = rnd.next(1, maxVal); } } // Apply sorting patterns if (pattern == 1) { sort(a.begin(), a.end()); } else if (pattern == 2) { sort(a.begin(), a.end(), greater()); } // Outpu

코드 #6190