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:T7ca,#include "testlib.h" #include using namespace std; int main(int argc, char* argv[]) { registerGen(argc, argv, 1); // Hyperparameters: // number of numbers in expression (terms) int terms = rnd.next(2, 8); // probability to pick '-' versus '+' double minus_prob = rnd.next(0.0, 1.0); // maximum digits per number int max_digits = rnd.next(1, 5); vector nums; vector ops; // generate each number (allow leading zeros) for (int i = 0; i < terms; i++) { int len = rnd.next(1, max_digits); string s; for (int j = 0; j < len; j++) { // each digit 0-9 s += char('0' + rnd.next(0, 9)); } nums.push_back(s); } // generate operators between numbers for (int i = 0; i < terms - 1; i++) { // choose '-' with minus_prob, else '+' char op = (rnd.next() < minus_prob ? '-' : '+'); ops.push_back(op); } // build the expression and ensure it's <= 50 chars string expr; for (int i = 0; i < terms; i++) { expr += nums[i]; if (i < terms - 1) expr += ops[i]; } // if expression is too long, truncate number of terms if ((int)expr.size() > 50) { // recompute with fewer terms terms = rnd.next(2, 5); nums.clear(); ops.clear()

코드 #2329