# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
23599 | 0xrgb | Treasure (different grader from official contest) (CEOI13_treasure2) | C++14 | 0 ms | 1224 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"
const int MAXN = 104;
int ans[MAXN][MAXN];
void findTreasure (int N) {
for (int i = 1; i <= N; ++i) {
for (int j = 1; j <= N; ++j) {
ans[i][j] = countTreasure(1, 1, i, j);
}
}
for (int i = 1; i <= N; ++i) {
for (int j = 1; j <= N; ++j) {
const int p = ans[i][j]\
- ans[i - 1][j]\
- ans[i][j - 1]\
+ ans[i - 1][j - 1];
if (p == 1) Report(i, j);
}
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |