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:T712,#include "testlib.h" #include #include #include #include using namespace std; int main(int argc, char* argv[]) { registerGen(argc, argv, 1); // Hyper-parameter: size of set S int N = rnd.next(1, 10); // Hyper-parameter: alphabet size for S int K = rnd.next(2, 4); vector alph; for (int i = 0; i < K; i++) alph.push_back(char('a' + i)); // Generate unique strings for S set S_set; while ((int)S_set.size() < N) { int len = rnd.next(1, 6); string s; for (int i = 0; i < len; i++) s.push_back(rnd.any(alph)); S_set.insert(s); } vector S(S_set.begin(), S_set.end()); shuffle(S.begin(), S.end()); // Number of queries int Q = rnd.next(1, 10); // Hyper-parameter: number of positive cases int num_hits; if (Q == 1) num_hits = rnd.next(0, 1); else num_hits = rnd.next(1, Q - 1); vector queries; // Generate hit cases for (int i = 0; i < num_hits; i++) { string pat = rnd.any(S); int plen = pat.size(); int L = rnd.next(plen, 15); int pre = rnd.next(0, L - plen); int post = L - plen - pre; string t; for (int j = 0; j < pre; j++) t.push_back(rnd.any(alph)); t += pat; for (int j = 0; j < post; j++) t.push_back(rnd.any(alph)); queries.push_back(t); } // Generate miss cases (u

코드 #4020