Pagini recente » Borderou de evaluare (job #1074082) | Borderou de evaluare (job #553823) | Borderou de evaluare (job #1446455) | Borderou de evaluare (job #1273679) | Borderou de evaluare (job #1265357)
Borderou de evaluare (job #1265357)
Raport evaluator
Compilare:
user.cpp: In function ‘int main()’:
user.cpp:35:36: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
freopen("algsort.in","r",stdin);
^
user.cpp:36:38: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
freopen("algsort.out","w",stdout);
^
user.cpp:37:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&n);
^
user.cpp:39:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&v[i]);
^
| Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
Punctaj/grupa |
| 1 | 0ms | 268kb | Incorect | 0 | 0 |
| 2 | 0ms | 264kb | Incorect | 0 |
| 3 | 0ms | 264kb | OK | 5 |
| 4 | 0ms | 264kb | Incorect | 0 |
| 5 | 0ms | 276kb | Incorect | 0 | 0 |
| 6 | 0ms | 276kb | Incorect | 0 |
| 7 | 0ms | 280kb | OK | 5 |
| 8 | 0ms | 280kb | Incorect | 0 |
| 9 | Depăşit | 1036kb | Time limit exceeded. | 0 | 0 |
| 10 | Depăşit | 1028kb | Time limit exceeded. | 0 |
| 11 | Depăşit | 1028kb | Time limit exceeded. | 0 |
| 12 | Depăşit | 1028kb | Time limit exceeded. | 0 |
| 13 | Depăşit | 2968kb | Time limit exceeded. | 0 | 0 |
| 14 | Depăşit | 2968kb | Time limit exceeded. | 0 |
| 15 | Depăşit | 2972kb | Time limit exceeded. | 0 |
| 16 | Depăşit | 2972kb | Time limit exceeded. | 0 |
| 17 | 160ms | 4148kb | Killed by signal 11(SIGSEGV). | 0 | 0 |
| 18 | 164ms | 4144kb | Killed by signal 11(SIGSEGV). | 0 |
| 19 | 184ms | 4168kb | Incorect | 0 |
| 20 | 160ms | 4140kb | Killed by signal 11(SIGSEGV). | 0 |
| Punctaj total | 0 |