# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
4572 | 2013-11-03T05:40:23 Z | cki86201 | Treasure (different grader from official contest) (CEOI13_treasure2) | C++ | 0 ms | 1228 KB |
#include<treasure.h> int T[105][105]; void findTreasure (int N) { int i,j; for(i=1;i<=N;i++){ for(j=1;j<=N;j++){ T[i][j]=countTreasure(1,1,i,j); } } for(i=1;i<=N;i++){ for(j=1;j<=N;j++){ if(T[i][j]-T[i-1][j]-T[i][j-1]+T[i-1][j-1])Report(i,j); } } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 1228 KB | Output is partially correct - N = 5, K = 425, score = 8 |
2 | Incorrect | 0 ms | 1228 KB | Output is partially correct - N = 10, K = 7075, score = 4 |
3 | Incorrect | 0 ms | 1228 KB | Output is partially correct - N = 15, K = 36450, score = 4 |
4 | Incorrect | 0 ms | 1228 KB | Output is partially correct - N = 16, K = 47296, score = 4 |
5 | Incorrect | 0 ms | 1228 KB | Output is partially correct - N = 55, K = 6782050, score = 4 |
6 | Incorrect | 0 ms | 1228 KB | Output is partially correct - N = 66, K = 14090571, score = 4 |
7 | Incorrect | 0 ms | 1228 KB | Output is partially correct - N = 77, K = 26140961, score = 4 |
8 | Incorrect | 0 ms | 1228 KB | Output is partially correct - N = 88, K = 44642224, score = 4 |
9 | Incorrect | 0 ms | 1228 KB | Output is partially correct - N = 99, K = 71566902, score = 4 |
10 | Incorrect | 0 ms | 1228 KB | Output is partially correct - N = 100, K = 74507500, score = 4 |