#include "dowsing.h"
bool B[101][101];
void FindTreasure(int N) {
int i, tmp = 0, ai, aj;
for (i=1; i<=N; i++){
B[1][i] = Detect(1, i);
if (B[1][i]) ++tmp;
if (i > 1 && tmp == 1) break;
if (tmp > 1) break;
}
if (tmp == 1){
if (B[1][1]) aj = 1;
else aj = i;
for (i=1; i<=N; i++){
if (!Detect(i, aj)) return Report(i, aj);
}
}
else{
ai = 1;
for (i=1; i<=N; i++){
if (!Detect(ai, i)) return Report(ai, i);
}
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
2 ms |
256 KB |
Execution failed because the return code was nonzero |
2 |
Halted |
0 ms |
0 KB |
- |