1a:I[10086,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","6706","static/chunks/6706-6cc81d14a1434b93.js","643","static/chunks/app/codes/%5Bid%5D/page-b7567db79e5dba86.js"],"AdSenseInsert"] 1b:I[48803,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","6706","static/chunks/6706-6cc81d14a1434b93.js","643","static/chunks/app/codes/%5Bid%5D/page-b7567db79e5dba86.js"],"CodeViewer"] 1c:T6e0,#include "testlib.h" #include #include #include #include using namespace std; int main(int argc, char* argv[]) { registerGen(argc, argv, 1); // Hyper-parameter: number of participants (1 to 10) int n = rnd.next(1, 10); // Prepare some distinct participant names vector pool = { "Alice", "Bob", "Carol", "Dave", "Eve", "Frank", "Grace", "Heidi", "Ivan", "Judy", "Mallory", "Niaj", "Olivia", "Peggy", "Sybil", "Trent" }; shuffle(pool.begin(), pool.end()); vector names(pool.begin(), pool.begin() + n); // Generate bids following doubling rule vector bets(n); bets[0] = rnd.next(1, 99); // initial bid int64_t current_max = bets[0]; for (int i = 1; i < n; i++) { // factor between 2 and 5 int f = rnd.next(2, 5); bets[i] = current_max * f; current_max = max(current_max, bets[i]); } // Decide if there is a winning subset bool has_solution = rnd.next(0, 9) < 7; // 70% chance of solution int64_t s_val; if (has_solution) { // pick a random non-empty subset int k = rnd.next(1, n); vector idx(n); for (int i = 0; i < n; i++) idx[i] = i; shuffle(idx.begin(), idx.end()); s_val = 0; for (int i = 0; i < k; i++) { s_val += bets[idx[i]]; } } else { // make s greater than total su

코드 #6053