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:T6dd,#include "testlib.h" #include #include #include using namespace std; int main(int argc, char* argv[]) { registerGen(argc, argv, 1); // Hyper-parameter: bias for n vector tns = {-2, -1, 0, 1, 2}; int t_n = rnd.any(tns); // n in [2..10], biased by wnext int n = rnd.wnext(9, t_n) + 2; // Hyper-parameter: choose k either uniform or biased int k; if (rnd.next(0, 1) == 0) { k = rnd.next(2, n); } else { vector signs = {-1, 1}; int t_k = rnd.any(signs); // k in [2..n], biased by wnext k = rnd.wnext(n - 1, t_k) + 2; if (k > n) k = n; } // Build a random partition of n into k positive parts vector sizes(k, 1); int rem = n - k; for (int i = 0; i < rem; ++i) { int idx = rnd.next(k); // [0..k-1] sizes[idx]++; } // Assign node labels randomly to the parts vector nodes(n); iota(nodes.begin(), nodes.end(), 1); shuffle(nodes.begin(), nodes.end()); vector part(n + 1); int ptr = 0; for (int i = 0; i < k; ++i) { for (int j = 0; j < sizes[i]; ++j) { part[nodes[ptr++]] = i; } } // Build the complete k-partite graph: edges only between different parts vector> edges; for (int u = 1; u <= n; ++u) { for (int v = u + 1; v <= n; ++v) { if (part[u] != part[v]) {

코드 #2837