# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
320993 | monus1042 | Treasure (different grader from official contest) (CEOI13_treasure2) | C++17 | 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.
#include "treasure.h"
#include <bits/stdc++.h>
using namespace std;
void findTreasure (int N) {
//int cnt = countTreasure(1, 1, N, N);
//if(cnt > 0) Report (1, 1);
for (int i=1; i<=N; i++){
for (int j=1; j<=N; j++){
int counter = countTreasure(i,j);
if (counter == 1){
Report(i,j);
}
}
}
}