1a:I[10086,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","6706","static/chunks/6706-6cc81d14a1434b93.js","643","static/chunks/app/codes/%5Bid%5D/page-b7567db79e5dba86.js"],"AdSenseInsert"] 1b:I[48803,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","6706","static/chunks/6706-6cc81d14a1434b93.js","643","static/chunks/app/codes/%5Bid%5D/page-b7567db79e5dba86.js"],"CodeViewer"] 1c:T7de,#include "testlib.h" #include #include #include using namespace std; int main(int argc, char* argv[]) { registerGen(argc, argv, 1); // Number of sticks int N = rnd.next(3, 8); const int MAXX = 100, MAXY = 1000; // Probability that a new segment overlaps in x with a previous one double overlapProb = rnd.next(0.0, 1.0); // Choose distinct y-coordinates and sort them (lower y = closer to edge) set yset; while ((int)yset.size() < N) { yset.insert(rnd.next(1, MAXY)); } vector ys(yset.begin(), yset.end()); sort(ys.begin(), ys.end()); // Store segments and their x-intervals vector> segs(N); vector> xint(N); for (int k = 0; k < N; k++) { int y = ys[k]; // Decide for each previous segment whether we should overlap in x vector need(N, false); for (int i = 0; i < k; i++) { need[i] = (rnd.next() < overlapProb); } // Find an x-interval satisfying all required overlaps/non-overlaps int x1, x2; for (int trial = 0; trial < 1000; trial++) { x1 = rnd.next(0, MAXX - 1); int maxLen = MAXX - x1; int len = rnd.next(1, min(15, maxLen)); x2 = x1 + len; bool ok = true; for (int i = 0; i < k; i++) { bool inter = !(x2 < xint[i].first || x1 > xint[i].second)

코드 #6093