#include"treasure.h"
int arr[101][101];
void findTreasure(int n)
{
int i,j;
for(i=1;i<=n;i++)for(j=1;j<=n;j++)
{
if(i<n/2)
{
if(j<n/2)
arr[i][j]=countTreasure(i,j,n,n)+countTreasure(i+1,j+1,n,n)-countTreasure(i+1,j,n,n)-countTreasure(i,j+1,n,n);
else
arr[i][j]=countTreasure(i,1,n,j)+countTreasure(i+1,1,n,j-1)-countTreasure(i+1,1,n,j)-countTreasure(i,1,n,j-1);
}
else
{
if(j<n/2)
arr[i][j]=countTreasure(1,j,i,n)+countTreasure(1,j+1,i-1,n)-countTreasure(1,j,i-1,n)-countTreasure(1,j+1,i,n);
else
arr[i][j]=countTreasure(1,1,i,j)+countTreasure(1,1,i-1,j-1)-countTreasure(1,1,i-1,j)-countTreasure(1,1,i,j-1);
}
}
for(i=1;i<=n;i++)for(j=1;j<=n;j++)if(arr[i][j])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 |
1224 KB |
Output isn't correct - N = 5, K = 1511, score = 0 |
2 |
Incorrect |
0 ms |
1224 KB |
Output isn't correct - N = 10, K = 18496, score = 0 |
3 |
Incorrect |
0 ms |
1224 KB |
Output isn't correct - N = 15, K = 92511, score = 0 |
4 |
Incorrect |
0 ms |
1224 KB |
Output isn't correct - N = 16, K = 117244, score = 0 |
5 |
Incorrect |
0 ms |
1224 KB |
Output isn't correct - N = 55, K = 16066511, score = 0 |
6 |
Incorrect |
0 ms |
1224 KB |
Output isn't correct - N = 66, K = 33249344, score = 0 |
7 |
Incorrect |
0 ms |
1224 KB |
Output isn't correct - N = 77, K = 61621559, score = 0 |
8 |
Incorrect |
0 ms |
1224 KB |
Output isn't correct - N = 88, K = 105024124, score = 0 |
9 |
Incorrect |
0 ms |
1224 KB |
Output isn't correct - N = 99, K = 168275799, score = 0 |
10 |
Incorrect |
0 ms |
1224 KB |
Output isn't correct - N = 100, K = 175099996, score = 0 |