#ifdef NACHIA #define _GLIBCXX_DEBUG #else #define NDEBUG #endif #include #include #include #include #include #include #include #include #include using i64 = long long; using u64 = unsigned long long; #define rep(i,n) for(int i=0; i=0; i--) const i64 INF = 1001001001001001001; const char* yn(bool x){ return x ? "Yes" : "No"; } template void chmin(A& l, const A& r){ if(r < l) l = r; } template void chmax(A& l, const A& r){ if(l < r) l = r; } template using nega_queue = std::priority_queue,std::greater>; using Modint = atcoder::static_modint<998244353>; //#include "nachia/vec.hpp" using namespace std; void testcase(){ int N = 1002; int X = 1000; vector W, V; W.push_back(1); V.push_back(100000); W.push_back(1); V.push_back(100000); for(int w=1; w<=1000; w++){ W.push_back(w); V.push_back(w * 99999 + 40000); } //vector D(X+1); //rep(i,N) for(i64 w=W[i]; w<=X; w++) chmax(D[w], D[w-W[i]] + V[i]); //vector> que(N); //rep(i,N) que[i] = {W[i], V[i]}; //sort(que.begin(), que.end(), [&](auto a, auto b){ // return make_pair(a.first*b.second, a.first) < make_pair(b.first*a.second, b.first); }); //vector E(X+1); //for(i64 w=1; w<=X; w++){ // i64 t = 0, ww = w; // for(auto [u,v] : que) if(ww >= u){ ww -= u; t += v; } // E[w] = t; //} //rep(i,X+1) cout << D[i] << " "; //cout << endl; //rep(i,X+1) cout << E[i] << " "; //cout << endl; //i64 scnt = 0; //rep(i,X+1) if(i && D[i] == E[i]) scnt++; //cout << scnt << endl; cout << N << " " << X << "\n"; rep(i,N) cout << W[i] << " " << V[i] << "\n"; } int main(){ ios::sync_with_stdio(false); cin.tie(nullptr); #ifdef NACHIA int T; cin >> T; for(int t=0; t