# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1011677 | ezzzay | Xylophone (JOI18_xylophone) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "xylophone.h"
static int A[5000];
void solve(int 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);
}
}