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:T6c0,#include "testlib.h" #include using namespace std; int main(int argc, char* argv[]) { registerGen(argc, argv, 1); // Dimensions: allow some degenerate 1-row or 1-col cases bool lineCase = rnd.next() < 0.2; int N, M; if (lineCase) { if (rnd.next(0,1) == 0) { N = 1; M = rnd.next(1,6); } else { N = rnd.next(1,6); M = 1; } } else { N = rnd.next(1,6); M = rnd.next(1,6); } // Maximum stack height int Hmax = rnd.next(1,9); // Choose pattern for variability int pat = (Hmax >= 2 ? rnd.next(0,3) : rnd.next(0,1)); vector> a(N, vector(M)); if (pat == 0) { // Fully random for (int i = 0; i < N; i++) for (int j = 0; j < M; j++) a[i][j] = rnd.next(1, Hmax); } else if (pat == 1) { // Uniform grid int h = rnd.next(1, Hmax); for (int i = 0; i < N; i++) for (int j = 0; j < M; j++) a[i][j] = h; } else if (pat == 2) { // Row-wise constant vector rowVal(N); for (int i = 0; i < N; i++) rowVal[i] = rnd.next(1, Hmax); for (int i = 0; i < N; i++) for (int j = 0; j < M; j++) a[i][j] = rowVal[i]; } else { // Checkerboard high/low int v1 = rnd.next(1, Hmax), v2 = rnd.next(1, Hmax); while (v2

코드 #6416