Pagini recente » Borderou de evaluare (job #1685970) | Borderou de evaluare (job #1601873) | Borderou de evaluare (job #2051545) | Borderou de evaluare (job #602974) | Borderou de evaluare (job #1693444)
Borderou de evaluare (job #1693444)
Raport evaluator
Compilare:
user.cpp: In function ‘void scan()’:
user.cpp:56:26: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
freopen(IN,"r",stdin);
^
user.cpp:57:28: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
freopen(OUT,"w",stdout);
^
user.cpp:59:29: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d%d",&X,&Y,&Z);
^
user.cpp:60:32: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
FOR(i,1,X) scanf("%d",S1+i);
^
user.cpp:61:32: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
FOR(i,1,Y) scanf("%d",S2+i);
^
user.cpp:62:32: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
FOR(i,1,Z) scanf("%d",S3+i);
^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 16ms | 2552kb | OK | 5 |
2 | 12ms | 2572kb | OK | 5 |
3 | 8ms | 2556kb | OK | 5 |
4 | 68ms | 2820kb | OK | 5 |
5 | 68ms | 2816kb | OK | 5 |
6 | 96ms | 2748kb | OK | 5 |
7 | 104ms | 2928kb | OK | 5 |
8 | 104ms | 2916kb | OK | 5 |
9 | 96ms | 2816kb | OK | 5 |
10 | 140ms | 2928kb | OK | 5 |
11 | 888ms | 3404kb | OK | 5 |
12 | 788ms | 3312kb | OK | 5 |
13 | 844ms | 3380kb | OK | 5 |
14 | 852ms | 3384kb | OK | 5 |
15 | 856ms | 3396kb | OK | 5 |
16 | 656ms | 3404kb | OK | 5 |
17 | 620ms | 3388kb | OK | 5 |
18 | 692ms | 3404kb | OK | 5 |
19 | 600ms | 3364kb | OK | 5 |
20 | 628ms | 3384kb | OK | 5 |
Punctaj total | 100 |