# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1011678 | 2024-07-01T05:04:58 Z | ezzzay | Xylophone (JOI18_xylophone) | C++17 | 0 ms | 0 KB |
#include "xylophone.h" #include<bits/stdc++.h> using namespace std; static int A[5000]; void solve(int N) { int n=N; int x; for(int i=2;i<N;i++){ if(query(1,N)!=N-1){ x=i-1; break; // i ni 1 esul 5 } } for(int i=1;i<=n;i++){ ans(i,i); } }