| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 78343 | win11905 | Treasure (different grader from official contest) (CEOI13_treasure2) | C++11 | 3 ms | 568 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 <bits/stdc++.h>
using namespace std;
int ans[105][105];
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) if(ans[i][j] - ans[i-1][j] - ans[i][j-1] + ans[i-1][j-1] == 1) Report(i, j);
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||