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:T611,#include "testlib.h" #include #include using namespace std; int main(int argc, char* argv[]) { registerGen(argc, argv, 1); // Hyper-parameter: size N of the table int N = rnd.next(1, 10); // Choose a random range size R using a weighted next for diversity int Rlo = N * N; int Rhi = N * N * 5; int diff = Rhi - Rlo; int t = rnd.next(-2, 2); int rangeSz = rnd.wnext(diff + 1, t) + Rlo; int R = rangeSz; // Build a pool of distinct integers in [-R, R] vector pool; pool.reserve(2 * R + 1); for (int x = -R; x <= R; ++x) { pool.push_back(x); } shuffle(pool.begin(), pool.end()); pool.resize(N * N); // Fill columns so that each column is strictly increasing vector> a(N, vector(N)); for (int j = 0; j < N; ++j) { vector col; for (int i = 0; i < N; ++i) { col.push_back(pool[j * N + i]); } sort(col.begin(), col.end()); // ensures strictly increasing since pool has unique values for (int i = 0; i < N; ++i) { a[i][j] = col[i]; } } // Randomly permute columns to add diversity vector colOrd(N); for (int i = 0; i < N; ++i) colOrd[i] = i; shuffle(colOrd.begin(), colOrd.end()); // Output the test case println(N); for (int i = 0; i < N; ++i) { vector row; for (int j = 0; j < N; ++j) {

코드 #3767