# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
30491 | rondojim | Treasure (different grader from official contest) (CEOI13_treasure2) | C++14 | 0 ms | 1272 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[150][150];
void findTreasure(int N){
for(int i=1; i<=N; ++i)
for(int j=1; j<=N; ++j)
A[i][j] = countTreasure(1, 1, j, j);
for(int i=1; i<=N; ++i)
for(int j=1; j<=N; ++j)
if(A[i][j] - A[i - 1][j] - A[i][j - 1] + A[i - 1][j - 1])
Report(i, j);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |