#include <bits/stdc++.h>
#include "treasure.h"
const int maxn = 110;
int pref[maxn][maxn];
void findTreasure (int N)
{
int n = N;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
pref[i][j] = countTreasure(1, 1, i, j);
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
int ant = pref[i-1][j]+pref[i][j-1]-pref[i-1][j-1];
if (pref[i][j] == ant+1) Report(i, j);
}
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Partially correct |
3 ms |
384 KB |
Output is partially correct - N = 5, K = 425, score = 8 |
2 |
Partially correct |
2 ms |
384 KB |
Output is partially correct - N = 10, K = 7075, score = 4 |
3 |
Partially correct |
2 ms |
384 KB |
Output is partially correct - N = 15, K = 36450, score = 4 |
4 |
Partially correct |
2 ms |
384 KB |
Output is partially correct - N = 16, K = 47296, score = 4 |
5 |
Partially correct |
2 ms |
384 KB |
Output is partially correct - N = 55, K = 6782050, score = 4 |
6 |
Partially correct |
2 ms |
384 KB |
Output is partially correct - N = 66, K = 14090571, score = 4 |
7 |
Partially correct |
2 ms |
384 KB |
Output is partially correct - N = 77, K = 26140961, score = 4 |
8 |
Partially correct |
2 ms |
384 KB |
Output is partially correct - N = 88, K = 44642224, score = 4 |
9 |
Partially correct |
2 ms |
640 KB |
Output is partially correct - N = 99, K = 71566902, score = 4 |
10 |
Partially correct |
3 ms |
512 KB |
Output is partially correct - N = 100, K = 74507500, score = 4 |