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:T754,#include "testlib.h" #include using namespace std; int main(int argc, char* argv[]) { registerGen(argc, argv, 1); // Hyper-parameter: number of vertical edges h (so m = 2*h) int h = rnd.next(2, 5); int m = 2 * h; // Hyper-parameters for diversity int t_w = rnd.any(vector{-1, 0, 1}); // width bias int t_h = rnd.any(vector{-1, 0, 1}); // height bias int t_n = rnd.any(vector{-1, 0, 1}); // number of points bias // Generate widths of the (h-1) horizontal spans vector w(h - 1); for (int i = 0; i < h - 1; i++) { // w in [1..10], biased w[i] = rnd.wnext(10, t_w) + 1; } // X-coordinates of vertical edges vector x(h); x[0] = 0; for (int i = 1; i < h; i++) { x[i] = x[i - 1] + w[i - 1]; } // Heights for the (h-1) top horizontal edges vector y(h - 1); for (int i = 0; i < h - 1; i++) { // y in [1..20], biased y[i] = rnd.wnext(20, t_h) + 1; } // Build v-array of size m: odd indices are x, even are y (0-based: even=>x, odd=>y) vector v(m); v[0] = 0; for (int j = 1; j < h; j++) { v[2*j] = x[j]; } for (int j = 0; j < h - 1; j++) { v[2*j + 1] = y[j]; } v[m - 1] = 0; // last y back to road // Number of points int n = rnd.wnext(11, t_n); // in [0..10], biased // Generate points inside or on boundary vector

코드 #5344