1a:I[10086,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","5538","static/chunks/5538-ed47f067afaa5003.js","7412","static/chunks/7412-2a540dc7a2630d42.js","643","static/chunks/app/codes/%5Bid%5D/page-7c5a09ccd6f58860.js"],"AdSenseInsert"] 1b:I[48803,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","5538","static/chunks/5538-ed47f067afaa5003.js","7412","static/chunks/7412-2a540dc7a2630d42.js","643","static/chunks/app/codes/%5Bid%5D/page-7c5a09ccd6f58860.js"],"CodeViewer"] 1c:T6d5,#include "testlib.h" #include using namespace std; int main(int argc, char* argv[]) { registerGen(argc, argv, 1); // Length of the DNA sequence int N = rnd.next(1, 20); // Decide a pattern type by a random probability double pat = rnd.next(); string letters = "ACGT"; string s(N, 'A'); if (pat < 0.15) { // All same character char c = rnd.any(letters); for (int i = 0; i < N; i++) s[i] = c; } else if (pat < 0.30) { // Two-character alternating char c1 = rnd.any(letters); char c2; do { c2 = rnd.any(letters); } while (c2 == c1); for (int i = 0; i < N; i++) { s[i] = (i % 2 == 0 ? c1 : c2); } } else if (pat < 0.50) { // Block pattern: repeat a character in blocks of size b int b = rnd.next(1, N); char curr = rnd.any(letters); for (int i = 0; i < N; i++) { if (i % b == 0) curr = rnd.any(letters); s[i] = curr; } } else if (pat < 0.70) { // Palindromic structure int half = (N + 1) / 2; for (int i = 0; i < half; i++) s[i] = rnd.any(letters); for (int i = 0; i < N - half; i++) s[N - 1 - i] = s[i]; } else if (pat < 0.90) { // Periodic pattern with small period i

코드 #2800