# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
233474 | 2020-05-20T16:11:49 Z | limabeans | Xylophone (JOI18_xylophone) | C++17 | 0 ms | 0 KB |
#include "xylophone.h" #include <bits/stdc++.h> using namespace std; template<typename T> void out(T x) { cout << x << endl; exit(0); } #define watch(x) cout << (#x) << " is " << (x) << endl typedef long long ll; const ll mod = 1e9+7; const int maxn = 1e6 + 5; int n; //grader // int query(int s, int t) { // } // void answer(int i, int a) { // assert(i>=1 && i<=n); // cout<<a<<"\n"; // } void solve(int N) { n = N; for (int i=1; i<=n; i++) { answer(i,i); } } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); return 0; }