#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);
}
}
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
364 KB |
Error - not all of the treasure cells have been reported |
2 |
Incorrect |
0 ms |
364 KB |
Error - not all of the treasure cells have been reported |
3 |
Incorrect |
0 ms |
364 KB |
Error - not all of the treasure cells have been reported |
4 |
Incorrect |
1 ms |
364 KB |
Error - not all of the treasure cells have been reported |
5 |
Incorrect |
0 ms |
364 KB |
Error - no treasure at (r, c) : r = 1, c = 3 |
6 |
Incorrect |
1 ms |
364 KB |
Error - not all of the treasure cells have been reported |
7 |
Incorrect |
1 ms |
364 KB |
Error - not all of the treasure cells have been reported |
8 |
Incorrect |
1 ms |
364 KB |
Error - no treasure at (r, c) : r = 1, c = 72 |
9 |
Incorrect |
1 ms |
364 KB |
Error - no treasure at (r, c) : r = 1, c = 2 |
10 |
Incorrect |
1 ms |
364 KB |
Error - no treasure at (r, c) : r = 1, c = 3 |