#include "dowsing.h"
int c, row[111], col[111], dr, dc;
void FindTreasure(int N) {
for(int i=1; i<=N; i++){
for(int j=1; j<=N; j++){
c = Detect(i,j);
row[i] += c, col[j] += c;
}
}
for(int i=1; i<=N; i++){
if(row[i] == N-1) dr=i;
}
for(int i=1; i<=N; i++){
if(col[i] == N-1) dc=i;
}
Report(dr, dc);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
256 KB |
Correct : C = 9 |
2 |
Correct |
2 ms |
256 KB |
Correct : C = 9 |
3 |
Partially correct |
6 ms |
376 KB |
Partially correct : C = 9801 |
4 |
Partially correct |
6 ms |
376 KB |
Partially correct : C = 9801 |
5 |
Partially correct |
6 ms |
376 KB |
Partially correct : C = 10000 |
6 |
Partially correct |
6 ms |
376 KB |
Partially correct : C = 10000 |
7 |
Partially correct |
6 ms |
376 KB |
Partially correct : C = 9801 |
8 |
Partially correct |
6 ms |
376 KB |
Partially correct : C = 10000 |
9 |
Partially correct |
6 ms |
376 KB |
Partially correct : C = 10000 |
10 |
Partially correct |
6 ms |
376 KB |
Partially correct : C = 10000 |
11 |
Partially correct |
6 ms |
376 KB |
Partially correct : C = 10000 |
12 |
Partially correct |
6 ms |
376 KB |
Partially correct : C = 9801 |