Pagini recente » Borderou de evaluare (job #2418105) | Borderou de evaluare (job #2548380) | Borderou de evaluare (job #1118785) | Borderou de evaluare (job #1517155) | Borderou de evaluare (job #1229687)
Borderou de evaluare (job #1229687)
Raport evaluator
Compilare:
user.cpp: In function ‘int main()’:
user.cpp:13:39: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
freopen("berarii2.in", "r", stdin);
^
user.cpp:14:41: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
freopen("berarii2.out", "w", stdout);
^
user.cpp:16:34: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d %d", &N, &M, &P);
^
user.cpp:21:31: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d", &X, &Y);
^
user.cpp:28:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &src);
^
| Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
| 1 | 16ms | 11984kb | OK | 5 |
| 2 | 16ms | 11984kb | OK | 5 |
| 3 | 16ms | 11984kb | OK | 5 |
| 4 | 16ms | 11984kb | Incorect | 0 |
| 5 | 16ms | 11988kb | Incorect | 0 |
| 6 | 16ms | 11984kb | Incorect | 0 |
| 7 | 16ms | 11984kb | Incorect | 0 |
| 8 | 16ms | 11992kb | OK | 5 |
| 9 | 16ms | 11992kb | Incorect | 0 |
| 10 | 24ms | 12048kb | Incorect | 0 |
| 11 | 24ms | 12096kb | Incorect | 0 |
| 12 | 76ms | 12824kb | OK | 5 |
| 13 | 532ms | 17668kb | OK | 5 |
| 14 | 36ms | 12136kb | Incorect | 0 |
| 15 | 712ms | 18948kb | OK | 5 |
| 16 | 704ms | 18276kb | Incorect | 0 |
| 17 | 808ms | 19320kb | Incorect | 0 |
| 18 | 892ms | 20256kb | Incorect | 0 |
| 19 | 980ms | 21092kb | Incorect | 0 |
| 20 | 1084ms | 21904kb | Incorect | 0 |
| Punctaj total | 35 |
lorund lorund