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:T7ca,#include "testlib.h" #include #include #include using namespace std; int main(int argc, char* argv[]) { registerGen(argc, argv, 1); // Small sizes int N = rnd.next(1, 10); int M = rnd.next(1, 20); // Hyper-parameter: pattern of the array int pattern = rnd.next(0, 3); vector A(N); if (pattern == 0) { // Completely random int hi = rnd.next(1, 100); for (int i = 0; i < N; i++) { A[i] = rnd.next(1, hi); } } else if (pattern == 1) { // Ascending order for (int i = 0; i < N; i++) { A[i] = rnd.next(1, 100); } sort(A.begin(), A.end()); } else if (pattern == 2) { // Descending order for (int i = 0; i < N; i++) { A[i] = rnd.next(1, 100); } sort(A.begin(), A.end(), greater()); } else { // Few distinct values int D = rnd.next(1, max(1, N/2)); int hi = rnd.next(2, 100); vector vals; for (int i = 0; i < D; i++) { vals.push_back(rnd.next(1, hi)); } sort(vals.begin(), vals.end()); vals.erase(unique(vals.begin(), vals.end()), vals.end()); if (vals.empty()) vals.push_back(1); for (int i = 0; i < N; i++) { A[i] = rnd.any(vals); } } // Hyper-parameter for query length bias double smallProb = rnd.next(0.0, 1.0);

코드 #4681