# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1010357 | _snoopy_ | Cave (IOI13_cave) | 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 <bits/stdc++.h>
using namespace std;
int s[10000], d[10000];
void tryCombination(int n){
for(int i=0; i<n; i++){
s[i]=0;
printf("%d ", s[i]);
}
printf("\n");
fflush(stdout);
int fld, a;
scanf("%d", &a);
for(int j=0; j<n; j++){
s[j]=1;
for(int i=0; i<n; i++){
printf("%d ", s[i]);
}
printf("\n");
fflush(stdout);
scanf("%d", &fld);
d[j]=fld;
s[j]=0;
}
}
int main(){
int n;
scanf("%d", &n);
tryCombination(n);
for(int i=0; i<n; i++){
printf("%d ", s[i]);
}
printf("\n");
for(int i=0; i<n; i++){
printf("%d ", d[i]);
}
}