Pagini recente » Borderou de evaluare (job #1376097) | Borderou de evaluare (job #1458180) | Borderou de evaluare (job #828481) | Borderou de evaluare (job #1337184) | Borderou de evaluare (job #1646790)
Borderou de evaluare (job #1646790)
Raport evaluator
Compilare:
user.cpp: In function ‘int main()’:
user.cpp:19:40: warning: format ‘%d’ expects argument of type ‘int*’, but argument 2 has type ‘short int*’ [-Wformat=]
for(i=1;i<=n;i++) scanf("%d",&v1[i]);
^
user.cpp:20:40: warning: format ‘%d’ expects argument of type ‘int*’, but argument 2 has type ‘short int*’ [-Wformat=]
for(i=1;i<=m;i++) scanf("%d",&v2[i]);
^
user.cpp:16:34: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
freopen("cmlsc.in","r",stdin);
^
user.cpp:17:36: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
freopen("cmlsc.out","w",stdout);
^
user.cpp:18:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&n,&m);
^
user.cpp:19:41: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
for(i=1;i<=n;i++) scanf("%d",&v1[i]);
^
user.cpp:20:41: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
for(i=1;i<=m;i++) scanf("%d",&v2[i]);
^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 0ms | 428kb | Lungime incorecta! | 0 |
2 | 0ms | 448kb | Raspuns corect! | 10 |
3 | 0ms | 460kb | Lungime incorecta! | 0 |
4 | 0ms | 824kb | Lungime incorecta! | 0 |
5 | 0ms | 940kb | Raspuns corect! | 10 |
6 | 4ms | 1452kb | Lungime incorecta! | 0 |
7 | 8ms | 2424kb | Raspuns corect! | 10 |
8 | 8ms | 2252kb | Lungime incorecta! | 0 |
9 | 8ms | 2436kb | Lungime incorecta! | 0 |
10 | 4ms | 2056kb | Lungime incorecta! | 0 |
Punctaj total | 30 |