| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 27227 | TAMREF | 보물 찾기 (CEOI13_treasure2) | C11 | 0 ms | 1184 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 "treasure.h"
int x[101], y[101], t;
void findTreasure (int N) {
int i,j;
for(i=1;i<=N;i++){
for(j=1;j<=N;j++){
if(countTreasure(i,j,i,j)){
x[t]=i,y[t++]=j;
}
}
}
for(i=0;i<t;i++) Report(x[i],y[i]);
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||