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:T512,#include "testlib.h" #include #include using namespace std; int main(int argc, char* argv[]) { registerGen(argc, argv, 1); // Hyperparameters for randomness int n = rnd.next(1, 10); // number of nodes double chain_prob = rnd.next(0.0, 1.0); // probability to attach in a chain int maxW = rnd.next(1, 100); // maximum edge weight // Generate a random rooted tree with root = 1 // and weights in [1, maxW] vector> edges; for (int i = 2; i <= n; i++) { int parent; if (rnd.next() < chain_prob) { // make a chain edge parent = i - 1; } else { // attach to any earlier node parent = rnd.next(1, i - 1); } int w = rnd.next(1, maxW); edges.emplace_back(parent, i, w); } // Sort edges by parent then child, to match input guarantee sort(edges.begin(), edges.end(), [](auto &a, auto &b) { if (get<0>(a) != get<0>(b)) return get<0>(a) < get<0>(b); return get<1>(a) < get<1>(b); }); // Output println(n); for (auto &e : edges) { int p, c, w; tie(p, c, w) = e; println(p, c, w); } return 0; }5:["$","div",null,{"className":"container mx-auto px-4","children

코드 #2343