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-8bf5a5fa194d2ba8.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-8bf5a5fa194d2ba8.js"],"CodeViewer"] 1c:T624,/* generator code */ #include "testlib.h" #include #include using namespace std; int main(int argc, char* argv[]) { registerGen(argc, argv, 1); // Small graph size for hand-checking int N = rnd.next(2, 10); int maxM = N * (N - 1) / 2; int M = rnd.next(N - 1, maxM); int K = rnd.next(1, min(20, M)); // Prepare containers vector> edges; vector> used(N+1, vector(N+1, false)); // 1) Ensure connectivity via a random spanning tree for (int v = 2; v <= N; ++v) { int u = rnd.next(1, v - 1); edges.emplace_back(u, v); used[u][v] = used[v][u] = true; } // 2) List remaining possible edges vector> cand; for (int i = 1; i <= N; ++i) { for (int j = i + 1; j <= N; ++j) { if (!used[i][j]) { cand.emplace_back(i, j); } } } // Shuffle candidates and pick extra edges shuffle(cand.begin(), cand.end()); int extra = M - (N - 1); for (int i = 0; i < extra; ++i) { edges.push_back(cand[i]); } // Shuffle full edge list for randomness shuffle(edges.begin(), edges.end()); // Output format: N M K, then M lines of "u v w" println(N, M, K); for (auto &e : edges) { int u = e.first, v = e.second; i

코드 #2626