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:T7da,#include "testlib.h" #include #include using namespace std; int main(int argc, char* argv[]) { registerGen(argc, argv, 1); // Small size for hand-checkability int N = rnd.next(4, 10); vector> edges; int mode = rnd.next(0, 4); if (mode == 0) { // Pure chain: 1-2-...-N for (int i = 1; i < N; i++) edges.emplace_back(i, i+1); } else if (mode == 1) { // Pure star: 1 connected to everyone else for (int i = 2; i <= N; i++) edges.emplace_back(1, i); } else if (mode == 2) { // Random tree via Prufer sequence vector prufer(N - 2); for (int &x : prufer) x = rnd.next(1, N); vector deg(N + 1, 1); for (int x : prufer) deg[x]++; vector leaves; for (int i = 1; i <= N; i++) if (deg[i] == 1) leaves.push_back(i); for (int x : prufer) { int idx = rnd.next(0, int(leaves.size()) - 1); int u = leaves[idx]; leaves[idx] = leaves.back(); leaves.pop_back(); edges.emplace_back(u, x); deg[u]--; deg[x]--; if (deg[x] == 1) leaves.push_back(x); } // connect the last two leaves edges.emplace_back(leaves[0], leaves[1]); } else if (mode == 3) { // Chain among 1..N-1, then attach N to

코드 #4981