Pagini recente » Borderou de evaluare (job #2470893) | Borderou de evaluare (job #2287190) | Borderou de evaluare (job #571693) | Borderou de evaluare (job #571564) | Borderou de evaluare (job #1263399)
Borderou de evaluare (job #1263399)
Raport evaluator
Compilare:
user.cpp: In function ‘int main()’:
user.cpp:33:37: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
freopen("concurs2.in","r",stdin);
^
user.cpp:34:39: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
freopen("concurs2.out","w",stdout);
^
user.cpp:35:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%ld",&n);
^
user.cpp:36:51: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
for (i=1;i<=n;i++) scanf("%ld%ld",&v[i],&x[i]);
^
user.cpp:41:34: warning: array subscript is below array bounds [-Warray-bounds]
if (a!=v[i]) {k++;z[k][-1]=v[i];z[k][0]++;z[k][z[k][0]]=x[i];a=v[i];}
^
user.cpp:45:31: warning: array subscript is below array bounds [-Warray-bounds]
for (i=1;i<=k;i++) z[i][-2]=z[i][0];
^
user.cpp:54:73: warning: array subscript is below array bounds [-Warray-bounds]
printf("%ld %ld\n",z[pozmaxim2][-1],z[pozmaxim2][z[pozmaxim2][-2]-z[pozmaxim2][0]+1]);
^
user.cpp:54:93: warning: array subscript is below array bounds [-Warray-bounds]
printf("%ld %ld\n",z[pozmaxim2][-1],z[pozmaxim2][z[pozmaxim2][-2]-z[pozmaxim2][0]+1]);
^
| Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
| 1 | 0ms | 476kb | OK | 10 |
| 2 | 0ms | 468kb | OK | 10 |
| 3 | 0ms | 500kb | OK | 10 |
| 4 | 0ms | 508kb | OK | 10 |
| 5 | 0ms | 504kb | OK | 10 |
| 6 | 0ms | 540kb | OK | 10 |
| 7 | 0ms | 552kb | OK | 10 |
| 8 | 0ms | 592kb | OK | 10 |
| 9 | 0ms | 628kb | OK | 10 |
| 10 | 0ms | 452kb | OK | 10 |
| Punctaj total | 100 |