Pagini recente » Borderou de evaluare (job #1688493) | Borderou de evaluare (job #2487746) | Borderou de evaluare (job #650738) | Borderou de evaluare (job #440602) | Borderou de evaluare (job #1926882)
Borderou de evaluare (job #1926882)
Raport evaluator
Compilare:
user.cpp: In function ‘int main()’:
user.cpp:46:36: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
freopen("invsort.in","r",stdin);
^
user.cpp:47:38: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
freopen("invsort.out","w",stdout);
^
user.cpp:48:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&n);
^
user.cpp:51: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 |
1 | 68ms | 684kb | OK -> cost = 1084920! | 5 |
2 | 68ms | 680kb | OK -> cost = 1084953! | 5 |
3 | 68ms | 684kb | OK -> cost = 1079232! | 5 |
4 | 68ms | 680kb | OK -> cost = 1079713! | 5 |
5 | 64ms | 680kb | OK -> cost = 1176506! | 5 |
6 | 64ms | 680kb | OK -> cost = 1017296! | 5 |
7 | 68ms | 684kb | OK -> cost = 1115895! | 5 |
8 | 68ms | 680kb | OK -> cost = 1053017! | 5 |
9 | 68ms | 676kb | OK -> cost = 1079205! | 5 |
10 | 68ms | 684kb | OK -> cost = 1099856! | 5 |
11 | 92ms | 680kb | Sirul nu este sortat! | 0 |
12 | 92ms | 676kb | Sirul nu este sortat! | 0 |
13 | 92ms | 676kb | Sirul nu este sortat! | 0 |
14 | 88ms | 684kb | Sirul nu este sortat! | 0 |
15 | 88ms | 680kb | Sirul nu este sortat! | 0 |
16 | 88ms | 680kb | Sirul nu este sortat! | 0 |
17 | 96ms | 676kb | Sirul nu este sortat! | 0 |
18 | 88ms | 676kb | Sirul nu este sortat! | 0 |
19 | 88ms | 680kb | Sirul nu este sortat! | 0 |
20 | 92ms | 684kb | Sirul nu este sortat! | 0 |
Punctaj total | 50 |