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:T780,#include "testlib.h" #include #include #include using namespace std; int main(int argc, char* argv[]) { registerGen(argc, argv, 1); // Number of crayons int N = rnd.next(2, 15); // Choose K with varied cases: small, large, or anywhere int K; double kCase = rnd.next(); if (kCase < 0.3) { K = rnd.next(2, min(N, 5)); } else if (kCase < 0.6) { K = rnd.next(max(2, N/2), N); } else { K = rnd.next(2, N); } // Cluster parameters int clusterCnt = rnd.next(1, min(5, K)); vector> centers(clusterCnt); for (int i = 0; i < clusterCnt; i++) { centers[i] = { rnd.next(0, 255), rnd.next(0, 255), rnd.next(0, 255) }; } // Probabilities for outliers and duplicates double pOutlier = rnd.next(0.0, 1.0); double pDup = rnd.next(0.0, 1.0); // Generate points vector> pts; pts.reserve(N); for (int i = 0; i < N; i++) { if (i > 0 && rnd.next() < pDup) { // Duplicate a previous point pts.push_back(pts[rnd.next(0, (int)pts.size() - 1)]); } else if (rnd.next() < pOutlier) { // Random outlier pts.push_back({ rnd.next(0,255), rnd.next(0,255), rnd.next(0,255) }); } else { // Clustered point around a random center auto c = centers[rnd.next(0, clusterCnt - 1)]; array p;

코드 #6029