# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
41040 | bgh2982 | 보물 찾기 (CEOI13_treasure2) | C++14 | 0 ms | 0 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.
int sum[101][101];
void findTreasure(int N) {
int i, j;
for (i = 1; i <= N; i++)
for (j = 1; j <= N; j++)
sum[i][j] = countTreasure(1, 1, i, j);
for(i=1 ; i<=N ; i++)
for(j=1 ; j<=N ; j++)
if (sum[i][j] - sum[i - 1][j] - sum[i][j - 1] + sum[i - 1][j - 1])
Report(i, j);
}