# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
41033 | haro199 | Treasure (different grader from official contest) (CEOI13_treasure2) | C11 | 2 ms | 700 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.
static int myMap[105][105];
void findTreasure(int N) {
//countTreasure(1, 1, N, N); SEARCH
//Report(2, 1); REPORT
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= N; j++) {
if (countTreasure(i, j, i, j))
myMap[i][j] = 1;
}
}
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= N; j++) {
if (myMap[i][j] == 1)
Report(i, j);
}
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |