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:T7d2,#include "testlib.h" #include #include using namespace std; int main(int argc, char* argv[]) { registerGen(argc, argv, 1); // Hyper-parameters for diversity int N = rnd.next(1, 10); // number of leaves int r = rnd.next(1, 5); // leaf size int d = rnd.next(1, 10); // max jump distance int maxDelta = rnd.next(r + 1, r + d + 5); vector> pos; pos.emplace_back(0, 0); // always include the leaf covering (0,0) // Generate remaining leaves by attaching to existing ones for (int i = 1; i < N; i++) { bool placed = false; for (int tries = 0; tries < 1000 && !placed; tries++) { auto [px, py] = pos[rnd.next(0, (int)pos.size() - 1)]; // Four directions vector> dirs = {{1,0}, {0,1}, {-1,0}, {0,-1}}; auto dir = rnd.any(dirs); int delta = rnd.next(r + 1, maxDelta); int x = px + dir.first * delta; int y = py + dir.second * delta; if (x < 0 || y < 0) continue; // Check non-overlap and no touching bool ok = true; for (auto &q : pos) { int x2 = q.first, y2 = q.second; if (!(x + r < x2 || x2 + r < x || y + r < y2 || y2 + r < y)) { ok = false; break; } } if (ok) { pos.emplace_back(x, y

코드 #3869