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:T64e,#include "testlib.h" #include #include #include using namespace std; int main(int argc, char* argv[]) { registerGen(argc, argv, 1); // Small sizes int N = rnd.next(3, 10); int K = rnd.next(3, min(10, N)); double eps = 1e-3; // Compute sector boundaries vector bounds; for (int i = 0; i < K; i++) { bounds.push_back(i * (360.0 / K)); } // Hyper-parameter: clustering vs uniform bool clusterMode = rnd.next() < 0.5; vector centers; double width = (360.0 / K) * 0.8; double halfWidth = width / 2.0; if (clusterMode) { int C = rnd.next(1, min(N, 3)); for (int i = 0; i < C; i++) { centers.push_back(rnd.next() * 360.0); } } // Generate angles avoiding boundaries vector angles; for (int i = 0; i < N; i++) { double ang; bool ok; do { if (clusterMode && rnd.next() < 0.9) { int c = rnd.next(0, (int)centers.size() - 1); ang = fmod(centers[c] + (rnd.next() * 2 - 1) * halfWidth + 360.0, 360.0); } else { ang = rnd.next() * 360.0; } ok = true; for (double b : bounds) { double d = fmod(ang - b + 360.0, 360.0); if (d > 180.0) d = 360.0 - d; if (d < eps) { ok = false; break; } } } while (!ok

코드 #2823