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:T50f,#include "testlib.h" #include #include using namespace std; int main(int argc, char* argv[]) { registerGen(argc, argv, 1); // Small size for hand-checkable array int N = rnd.next(1, 10); println(N); // Hyper-parameter for different patterns double r = rnd.next(); vector A(N); if (r < 0.2) { // Fully sorted (strictly increasing) for (int i = 0; i < N; i++) A[i] = i; } else if (r < 0.4) { // Fully reverse-sorted for (int i = 0; i < N; i++) A[i] = N - i; } else if (r < 0.6) { // Almost sorted: start sorted then apply a few random swaps for (int i = 0; i < N; i++) A[i] = i; int swaps = rnd.next(1, max(1, N - 1)); for (int k = 0; k < swaps; k++) { int p = rnd.next(0, N - 1); int q = rnd.next(0, N - 1); swap(A[p], A[q]); } } else if (r < 0.8) { // Many duplicates: small value range int maxv = rnd.next(0, 5); for (int i = 0; i < N; i++) A[i] = rnd.next(0, maxv); } else { // Completely random values in moderate range for (int i = 0; i < N; i++) A[i] = rnd.next(0, 100); } // Output each element on its own line for (int x : A) println(x); return 0; }5:["$","div",null,{"className":"container mx-auto px-4","children":[

코드 #2720