# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
320993 | 2020-11-10T14:59:46 Z | monus1042 | Treasure (different grader from official contest) (CEOI13_treasure2) | C++17 | 0 ms | 0 KB |
#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); } } } }