19:I[10086,["6079","static/chunks/363642f4-4672ca396f99db0d.js","5653","static/chunks/5653-e83dcf6c883f2fed.js","1394","static/chunks/1394-5772593fb24fe823.js","7412","static/chunks/7412-44bfc7df6d166700.js","2298","static/chunks/2298-6fcb566ac5ccd13f.js","643","static/chunks/app/codes/%5Bid%5D/page-38137606830fba89.js"],"AdSenseInsert"] 1a:I[48803,["6079","static/chunks/363642f4-4672ca396f99db0d.js","5653","static/chunks/5653-e83dcf6c883f2fed.js","1394","static/chunks/1394-5772593fb24fe823.js","7412","static/chunks/7412-44bfc7df6d166700.js","2298","static/chunks/2298-6fcb566ac5ccd13f.js","643","static/chunks/app/codes/%5Bid%5D/page-38137606830fba89.js"],"CodeViewer"] 1b:T5dd,#include "testlib.h" using namespace std; int main(int argc, char* argv[]) { registerGen(argc, argv, 1); int K = rnd.next(2, 3); println(K); while(K--) { int V = rnd.next(2, 9); vector> all_edges; int type = rnd.next(0, 1); if(type == 0) { // no force bipartite for(int i = 0; i < V; i++) { for(int j = i+1; j < V; j++) { all_edges.push_back({i, j}); } } } else { // force bipartite vector group(V); int point = rnd.next(1, V-1); for(int i = 0; i < point; i++) { group[i] = 0; } for(int i = point; i < V; i++) { group[i] = 1; } shuffle(group.begin(), group.end()); for(int i = 0; i < V; i++) { for(int j = i+1; j < V; j++) { if(group[i] != group[j]) { all_edges.push_back({i, j}); } } } } int M = rnd.next(1, (int)all_edges.size()); vector> edges(all_edges.begin(), all_edges.begin() + M); shuffle(edges.begin(), edges.end()); println(V, M); for(auto [u, v] : edges) { if(rnd

코드 #1733