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:T52f,#include "testlib.h" #include #include #include using namespace std; int main(int argc, char* argv[]) { registerGen(argc, argv, 1); const int MAXV = (1<<24) - 1; // 24-bit max int n = rnd.next(1, 10); vector vals; if (n >= 2) { // always include the extremes vals.push_back(1); vals.push_back(MAXV); for (int i = 2; i < n; i++) { int cat = rnd.next(0, 2); int v; if (cat == 0) { // bias towards small numbers v = rnd.wnext(MAXV+1, -2); } else if (cat == 1) { // bias towards large numbers v = rnd.wnext(MAXV+1, 2); } else { // uniform v = rnd.next(1, MAXV); } if (v == 0) v = 1; vals.push_back(v); } } else { // single test case: pick one extreme int v = (rnd.next(0, 1) == 0 ? 1 : MAXV); vals.push_back(v); } // shuffle to mix positions shuffle(vals.begin(), vals.end()); // output println(n); for (int v : vals) { string s(24, '0'); for (int i = 0; i < 24; i++) { if (v & (1 << (23 - i))) s[i] = '1'; } println(s); } return 0; }5:["$","div",null,{"className":"container mx-auto px-4","data-sentry-component":"CodePage","data-sentry-source-file":"page.tsx","chi

코드 #4523