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:T620,#include "testlib.h" #include #include #include using namespace std; int main(int argc, char* argv[]) { registerGen(argc, argv, 1); // Generate length N in [1,30] with bias int wN = rnd.any(vector{-3, -1, 0, 1, 3}); int N = rnd.wnext(30, wN) + 1; // Generate window size P in [1,N] with bias int wP = rnd.any(vector{-3, -1, 0, 1, 3}); int P = rnd.wnext(N, wP) + 1; // Build DNA string S with either uniform or skewed distribution vector letters = {'A','C','G','T'}; string S; S.reserve(N); if (rnd.next() < 0.3) { char major = rnd.any(letters); double skewProb = rnd.next() * 0.5 + 0.5; // between 0.5 and 1.0 for (int i = 0; i < N; i++) { if (rnd.next() < skewProb) S.push_back(major); else S.push_back(rnd.any(letters)); } } else { for (int i = 0; i < N; i++) { S.push_back(rnd.any(letters)); } } // Generate total requirement in [0,P] with bias int wReq = rnd.any(vector{-3, -1, 0, 1, 3}); int total_req = rnd.wnext(P+1, wReq); // yields 0..P // Randomly distribute total_req among A,C,G,T vector req(4); int rem = total_req; for (int i = 0; i < 3; i++) { int v = rnd.next(0, rem); req[i] = v; rem -= v; } req[3] = rem; shuffle(req.begin(), req.end());

코드 #5696