# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
362684 | 2021-02-04T05:53:56 Z | nighthallo | Treasure (different grader from official contest) (CEOI13_treasure2) | C++14 | 0 ms | 0 KB |
#include "treasure.h" void findTreasure (int N) { int arr[101][101]; for(int i = 1 ; i <= N ; i++){ for(int j = 1 ; j <= N ; j++){ arr[101][101] = countTreasure(i, j, i, j); } } for(int i = 1 ; i <= N ; i++){ for(int j = 1 ; j <= N ; j++){ if(arr[101][101]){ report(i, j); } } } }