Pagini recente » Borderou de evaluare (job #629366) | Borderou de evaluare (job #2672036) | Borderou de evaluare (job #2226748) | Borderou de evaluare (job #170149) | Borderou de evaluare (job #2603330)
Borderou de evaluare (job #2603330)
Raport evaluator
Compilare:
main.cpp: In function 'int main()':
main.cpp:29:21: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
if(S[i][j] < S[i][k] + S[k][j]);
^~
main.cpp:30:25: note: ...this statement, but the latter is misleadingly indented as if it is guarded by the 'if'
S[i][j] = S[i][k] + S[k][j];
^
main.cpp:6:33: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
freopen("rf.in", "r", stdin);
^
main.cpp:7:35: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
freopen("rf.out", "w", stdout);
^
main.cpp:8:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &n);
^
main.cpp:11:34: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &M[i][j]);
^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 3ms | 393kb | OK | 5 |
2 | 2ms | 393kb | OK | 5 |
3 | 3ms | 393kb | Incorect | 0 |
4 | 3ms | 393kb | Incorect | 0 |
5 | 7ms | 524kb | Incorect | 0 |
6 | 6ms | 524kb | Incorect | 0 |
7 | 21ms | 524kb | Incorect | 0 |
8 | 21ms | 524kb | Incorect | 0 |
9 | 21ms | 524kb | Incorect | 0 |
10 | 22ms | 655kb | Incorect | 0 |
11 | 109ms | 1048kb | Incorect | 0 |
12 | 113ms | 1048kb | Incorect | 0 |
13 | 113ms | 1048kb | Incorect | 0 |
14 | 91ms | 1048kb | Incorect | 0 |
15 | 113ms | 1048kb | Incorect | 0 |
16 | 103ms | 1048kb | Incorect | 0 |
17 | 115ms | 1048kb | Incorect | 0 |
18 | 106ms | 1048kb | Incorect | 0 |
19 | 115ms | 1048kb | Incorect | 0 |
20 | 99ms | 917kb | Incorect | 0 |
Punctaj total | 10 |