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:T7c8,#include "testlib.h" #include #include #include #include using namespace std; int main(int argc, char* argv[]) { registerGen(argc, argv, 1); // Hyper-parameter: number of parrots/sentences int N = rnd.next(1, 10); // Generate unique words pool set used; auto genUniqueWord = [&]() { while (true) { int len = rnd.next(1, 5); string w; for (int i = 0; i < len; i++) w += char('a' + rnd.next(0, 25)); if (!used.count(w)) { used.insert(w); return w; } } }; // Generate each sentence S_i vector> S(N); for (int i = 0; i < N; i++) { // sentence length varied int slen = rnd.next(1, 5); for (int j = 0; j < slen; j++) { S[i].push_back(genUniqueWord()); } } // Build a possible interleaving L vector L; vector> copyS = S; while (true) { vector nonempty; for (int i = 0; i < N; i++) if (!copyS[i].empty()) nonempty.push_back(i); if (nonempty.empty()) break; int which = rnd.any(nonempty); L.push_back(copyS[which].front()); copyS[which].erase(copyS[which].begin()); } // Randomly decide to break the sequence to make it impossible bool makeImpossible = rnd.n

코드 #4040