# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
42275 | rlqja2222 | Treasure (different grader from official contest) (CEOI13_treasure2) | C++14 | 2 ms | 832 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"
#include <cstdio>
int row[100];
int col[100];
void findTreasure(int N) {
int n = 0;
for (int r = 1; r <= N; r++) {
for (int c = 1; c <= N; c++) {
int t = countTreasure(r, c, r, c);
if (t) row[n] = r, col[n] = c, n++;
}
}
while (--n >= 0)
Report(row[n], col[n]);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |