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:T55a,#include "testlib.h" #include #include #include using namespace std; int main(int argc, char* argv[]) { registerGen(argc, argv, 1); // Hyper-parameter for N: bias towards small/large via wnext int biasN = rnd.next(-1, 1); int N = rnd.wnext(9, biasN) + 2; // N in [2,10] // Hyper-parameter for maximum weight int biasW = rnd.next(-1, 1); int maxW = rnd.next(1, 100); // Hyper-parameter for extra edges probability int p10 = rnd.next(1, 9); double extraP = p10 / 10.0; // Initialize adjacency matrix with zeros (0 means no edge or self-loop) vector> W(N, vector(N, 0)); // Ensure at least one Hamiltonian cycle exists vector perm(N); iota(perm.begin(), perm.end(), 0); shuffle(perm.begin(), perm.end()); for (int i = 0; i < N; i++) { int u = perm[i]; int v = perm[(i + 1) % N]; W[u][v] = rnd.next(1, maxW); } // Fill other edges randomly with probability extraP for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { if (i == j || W[i][j] > 0) continue; if (rnd.next() < extraP) { W[i][j] = rnd.wnext(maxW, biasW); } } } // Output println(N); for (int i = 0; i < N; i++) { println(W[i]); } return 0; }5:["$","div",null,{"className":"container mx-auto px-4","data-sentry-component":"CodePage

코드 #3779