#include "treasure.h"
int S[121][121];
void findTreasure (int n) {
int i, j, m = n/2;
for (i = n; i >= 1; i--)for (j = n; j >= 1; j--) {
if (m < i&&m < j)S[i][j] = countTreasure(1, 1, i, j);
if (m < i&&j <= m)S[i][j] = S[i][n] - countTreasure(1, j + 1, i, n);
if (i <= m&&m < j)S[i][j] = S[n][j] - countTreasure(i + 1, 1, n, j);
if (i <= m&&j <= m) S[i][j] = countTreasure(i + 1, j + 1, n, n) - S[n][n] + S[n][j] + S[i][n];
}
for (i = 1; i <= n; i++)for (j = 1; j <= n; j++)if (S[i][j] - S[i - 1][j] - S[i][j - 1] + S[i - 1][j - 1])Report(i, j);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct - N = 5, K = 289, score = 10 |
2 |
Correct |
2 ms |
376 KB |
Output is correct - N = 10, K = 4475, score = 10 |
3 |
Correct |
2 ms |
564 KB |
Output is correct - N = 15, K = 22289, score = 10 |
4 |
Correct |
2 ms |
564 KB |
Output is correct - N = 16, K = 28928, score = 10 |
5 |
Correct |
2 ms |
572 KB |
Output is correct - N = 55, K = 4005289, score = 10 |
6 |
Correct |
2 ms |
572 KB |
Output is correct - N = 66, K = 8305803, score = 10 |
7 |
Correct |
2 ms |
572 KB |
Output is correct - N = 77, K = 15383161, score = 10 |
8 |
Correct |
2 ms |
572 KB |
Output is correct - N = 88, K = 26244416, score = 10 |
9 |
Correct |
3 ms |
680 KB |
Output is correct - N = 99, K = 42032201, score = 10 |
10 |
Correct |
3 ms |
688 KB |
Output is correct - N = 100, K = 43760000, score = 10 |