#include "treasure.h"
int a[110][110];
void findTreasure (int N) {
int i,j;
for(i=N;i>=1;i--)
{
for(j=N;j>=1;j--)
{
if(i>N/2 && j>N/2) a[i][j]=countTreasure(1,1,i,j);
if(i<=N/2 && j>N/2) a[i][j]=a[N][j]-countTreasure(i+1,N,1,j);
if(i>N/2 && j<=N/2) a[i][j]=a[i][N]-countTreasure(1,i,j+1,N);
if(i<=N/2 && j<=N/2) a[i][j]=countTreasure(i+1,j+1,N,N)+a[i][N]+a[N][j]-a[N][N];
}
}
for(i=1;i<=N;i++)
{
for(j=1;j<=N;j++)
{
if(a[i][j]-a[i-1][j]-a[i][j-1]+a[i-1][j-1]) Report(i,j);
}
}
}
Compilation message
grader.c: In function 'int main()':
grader.c:63:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
my_assert(strlen(A[i]+1) == N, "each line of the map must contain N zeroes or ones (before loop)");
^
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
1232 KB |
Invalid Access |
2 |
Incorrect |
0 ms |
1232 KB |
Invalid Access |
3 |
Incorrect |
0 ms |
1232 KB |
Invalid Access |
4 |
Incorrect |
0 ms |
1232 KB |
Invalid Access |
5 |
Incorrect |
0 ms |
1232 KB |
Invalid Access |
6 |
Incorrect |
0 ms |
1232 KB |
Invalid Access |
7 |
Incorrect |
0 ms |
1232 KB |
Invalid Access |
8 |
Incorrect |
0 ms |
1232 KB |
Invalid Access |
9 |
Incorrect |
0 ms |
1232 KB |
Invalid Access |
10 |
Incorrect |
0 ms |
1232 KB |
Invalid Access |