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:T568,#include "testlib.h" #include #include #include using namespace std; int main(int argc, char* argv[]) { registerGen(argc, argv, 1); int T = rnd.next(1, 5); println(T); for (int tc = 0; tc < T; ++tc) { int n = rnd.next(3, 8); int k = rnd.next(3, 8); int t = rnd.next(1, n); int m_min = max(n, 3); int m_max = min(n * k * 2, 20); if (m_max < m_min) m_max = m_min; int m = rnd.next(m_min, m_max); vector> logs; // ensure each team has at least one submission for (int i = 1; i <= n; ++i) { int j = rnd.next(1, k); int w = rnd.any(vector{-2, -1, 0, 1, 2}); int s = rnd.wnext(101, w); logs.emplace_back(i, j, s); } // remaining submissions int rem = m - n; for (int i = 0; i < rem; ++i) { int team = rnd.next(1, n); int prob = rnd.next(1, k); int w = rnd.any(vector{-2, -1, 0, 1, 2}); int score = rnd.wnext(101, w); logs.emplace_back(team, prob, score); } shuffle(logs.begin(), logs.end()); println(n, k, t, m); for (auto &e : logs) { int ti, pj, sc; tie(ti, pj, sc) = e; println(ti, pj, sc); } } return 0; }5:["$","div",null,{"className":"container mx-auto px-4","data-sentry-compon

코드 #3493