# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
4524 | tncks0121 | 보물 찾기 (CEOI13_treasure2) | C++98 | 0 ms | 1228 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 A[105][105];
void findTreasure (int N) {
int i, j;
for(i = 1; i <= N; i++) {
for(j = 1; j <= N; j++) {
A[i][j] = countTreasure(1, 1, i, j);
}
}
for(i = 1; i <= N; i++) {
for(j = 1; j <= N; j++) {
if(A[i][j] - A[i-1][j] - A[i][j-1] + A[i-1][j-1] == 1) Report(i, j);
}
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |