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-7c5a09ccd6f58860.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-7c5a09ccd6f58860.js"],"CodeViewer"] 1c:T7df,/* generator code */ #include "testlib.h" #include #include using namespace std; int main(int argc, char* argv[]) { registerGen(argc, argv, 1); // Number of vertices: between 2 and 10 int V = rnd.next(2, 10); // All possible edges (undirected, i> all_edges; for (int i = 1; i <= V; i++) { for (int j = i+1; j <= V; j++) { all_edges.emplace_back(i, j); } } // Determine total edges M: at least V-1 for connectivity, up to complete graph int minE = V - 1; int maxE = (int)all_edges.size(); int M = rnd.next(minE, maxE); // Make a random spanning tree first to ensure connectivity vector perm(V); for (int i = 0; i < V; i++) perm[i] = i+1; shuffle(perm.begin(), perm.end()); // Mark tree edges vector> tree_edges; for (int i = 0; i+1 < V; i++) { int u = perm[i], v = perm[i+1]; if (u > v) swap(u, v); tree_edges.emplace_back(u, v); } // Remove tree edges from all_edges vector> rest; for (auto &e : all_edges) { bool is_tree = false; for (auto &t : tree_edges) { if (e.first == t.first && e.second == t.second) { is_tree = true; break; } } if (!is_tree) res

코드 #2423