Pagini recente » Borderou de evaluare (job #2596848) | Borderou de evaluare (job #2914995) | Borderou de evaluare (job #515923) | Borderou de evaluare (job #198078) | Borderou de evaluare (job #2202801)
Borderou de evaluare (job #2202801)
Raport evaluator
Compilare:
user.cpp: In function ‘int main()’:
user.cpp:21:13: warning: this ‘if’ clause does not guard... [-Wmisleading-indentation]
if(ap[j-greutate[i]]==0)
^~
user.cpp:23:17: note: ...this statement, but the latter is misleadingly indented as if it is guarded by the ‘if’
ap[j]=1;
^~
user.cpp:11:35: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
freopen("rucsac.in","r",stdin);
^
user.cpp:12:37: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
freopen("rucsac.out","w",stdout);
^
user.cpp:13:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d\n",&n,&g);
^
user.cpp:15:49: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d\n",&greutate[i],&profit[i]);
^
| Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
Punctaj/grupa |
| 1 | 0ms | 1336kb | OK | 5 | 10 |
| 2 | 0ms | 1332kb | OK | 5 |
| 3 | 0ms | 1332kb | OK | 5 | 15 |
| 4 | 0ms | 1332kb | OK | 5 |
| 5 | 0ms | 1332kb | OK | 5 |
| 6 | 0ms | 1332kb | OK | 5 | 10 |
| 7 | 0ms | 1336kb | OK | 5 |
| 8 | 4ms | 1336kb | OK | 5 | 15 |
| 9 | 4ms | 1336kb | OK | 5 |
| 10 | 4ms | 1336kb | OK | 5 |
| 11 | 68ms | 1364kb | OK | 5 | 15 |
| 12 | 36ms | 1364kb | OK | 5 |
| 13 | 36ms | 1372kb | OK | 5 |
| 14 | 116ms | 1392kb | OK | 5 | 15 |
| 15 | 220ms | 1396kb | OK | 5 |
| 16 | 116ms | 1396kb | OK | 5 |
| 17 | 72ms | 1376kb | OK | 5 | 20 |
| 18 | 272ms | 1392kb | OK | 5 |
| 19 | 144ms | 1392kb | OK | 5 |
| 20 | 148ms | 1392kb | OK | 5 |
| Punctaj total | 100 |