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:T78c,#include "testlib.h" #include #include #include #include using namespace std; int main(int argc, char* argv[]) { registerGen(argc, argv, 1); // Hyper-parameters for small sizes int K = rnd.next(1, 10); // number of words int N = rnd.next(1, 20); // number of queries int P = rnd.next(1, min(K, 5)); // number of distinct starting letters // Choose P distinct starting letters vector alpha; for (char c = 'a'; c <= 'z'; ++c) alpha.push_back(c); shuffle(alpha.begin(), alpha.end()); vector start_letters(alpha.begin(), alpha.begin() + P); // Generate K distinct words, ensuring coverage of each start letter set wordset; // First ensure one word per starting letter for (char c : start_letters) { int len = rnd.next(1, 5); string w; w.push_back(c); for (int i = 1; i < len; i++) { w.push_back(char(rnd.next('a', 'z'))); } wordset.insert(w); } // Fill up to K while ((int)wordset.size() < K) { char c = rnd.any(start_letters); int len = rnd.next(1, 5); string w; w.push_back(c); for (int i = 1; i < len; i++) { w.push_back(char(rnd.next('a', 'z'))); } wordset.insert(w); } // Move to vector and shuffle order vector words(wordset.begin(), wordset.end()); shuffle(words.be

코드 #4194