1a:I[10086,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","5538","static/chunks/5538-ed47f067afaa5003.js","7412","static/chunks/7412-2a540dc7a2630d42.js","643","static/chunks/app/codes/%5Bid%5D/page-7c5a09ccd6f58860.js"],"AdSenseInsert"] 1b:I[48803,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","5538","static/chunks/5538-ed47f067afaa5003.js","7412","static/chunks/7412-2a540dc7a2630d42.js","643","static/chunks/app/codes/%5Bid%5D/page-7c5a09ccd6f58860.js"],"CodeViewer"] 1c:T5b5,#include "testlib.h" #include #include #include using namespace std; int main(int argc, char* argv[]) { registerGen(argc, argv, 1); // Choose small sequence size int N = rnd.next(1, 10); int K = (N == 1 ? 0 : rnd.next(0, N - 1)); // Hyper-parameter: bound for values vector bounds = {10, 20, 50, 100}; int bound = rnd.any(bounds); // Decide a pattern for diversity double p = rnd.next(); vector A(N); if (N >= 2 && p < 0.25) { // Arithmetic progression within [-100,100] int start = rnd.next(-bound, bound); int maxDiff = (100 - abs(start)) / (N - 1); int diff = (maxDiff > 0 ? rnd.next(-maxDiff, maxDiff) : 0); for (int i = 0; i < N; i++) A[i] = start + diff * i; } else if (p < 0.5) { // All equal int v = rnd.next(-bound, bound); for (int i = 0; i < N; i++) A[i] = v; } else if (p < 0.75) { // Zigzag between two values int v1 = rnd.next(-bound, bound); int v2 = rnd.next(-bound, bound); for (int i = 0; i < N; i++) A[i] = (i % 2 ? v1 : v2); } else { // Completely random for (int i = 0; i < N; i++) A[i] = rnd.next(-bound, bound); } // Output println(N, K); for (int i = 0; i < N; i++)

코드 #2754