Pagini recente » Borderou de evaluare (job #1198974) | Borderou de evaluare (job #1194242) | Borderou de evaluare (job #823073) | Borderou de evaluare (job #819593) | Borderou de evaluare (job #2105535)
Borderou de evaluare (job #2105535)
Raport evaluator
Compilare:
user.cpp: In function ‘int main()’:
user.cpp:77: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:78: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:80:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&n);
^
user.cpp:82:30: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&a[i].val);
^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 16ms | 708kb | OK -> cost = 226194! | 5 |
2 | 16ms | 708kb | OK -> cost = 226109! | 5 |
3 | 28ms | 708kb | OK -> cost = 239104! | 5 |
4 | 20ms | 700kb | OK -> cost = 237760! | 5 |
5 | 20ms | 708kb | OK -> cost = 194792! | 5 |
6 | 12ms | 704kb | OK -> cost = 195671! | 5 |
7 | 16ms | 708kb | OK -> cost = 223844! | 5 |
8 | 16ms | 708kb | OK -> cost = 223646! | 5 |
9 | 16ms | 704kb | OK -> cost = 228632! | 5 |
10 | 16ms | 708kb | OK -> cost = 225864! | 5 |
11 | 152ms | 704kb | OK -> cost = 2244689! | 5 |
12 | 152ms | 708kb | OK -> cost = 2155274! | 5 |
13 | 152ms | 704kb | OK -> cost = 2187428! | 5 |
14 | 152ms | 704kb | OK -> cost = 2059417! | 5 |
15 | 156ms | 708kb | OK -> cost = 2185625! | 5 |
16 | 152ms | 704kb | OK -> cost = 2228216! | 5 |
17 | 80ms | 696kb | OK -> cost = 377154! | 5 |
18 | 108ms | 700kb | OK -> cost = 908555! | 5 |
19 | 76ms | 708kb | OK -> cost = 1646503! | 5 |
20 | 108ms | 704kb | OK -> cost = 1886334! | 5 |
Punctaj total | 100 |