# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
40594 | baactree | Treasure (different grader from official contest) (CEOI13_treasure2) | C++14 | 2 ms | 728 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 <string.h>
#include <stdio.h>
int mat[105][105];
void findTreasure (int N) {
for (int i = 1; i <= N; i++)
for (int j = 1; j <= N; j++)
mat[i][j] = countTreasure(i, j, i, j);
for (int i = 1; i <= N; i++)
for (int j = 1; j <= N; j++)
if (mat[i][j])
Report(i, j);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |