Pagini recente » Borderou de evaluare (job #1597212) | Borderou de evaluare (job #1674650) | Borderou de evaluare (job #1970022) | Borderou de evaluare (job #2601451) | Borderou de evaluare (job #2229577)
Borderou de evaluare (job #2229577)
Raport evaluator
Compilare:
user.cpp: In function ‘int main()’:
user.cpp:29:35: warning: suggest parentheses around comparison in operand of ‘&’ [-Wparentheses]
while(q & B[i][q + 1] != B[i][j])
~~~~~~~~~~~~^~~~~~~~~~
user.cpp:10:38: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
freopen("tetris2.in", "r", stdin);
^
user.cpp:11:40: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
freopen("tetris2.out", "w", stdout);
^
user.cpp:13:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &n);
^
user.cpp:16:34: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &a[i][j]);
^
user.cpp:20:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &m);
^
user.cpp:23:34: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &b[i][j]);
^
| Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
| 1 | 0ms | 3472kb | OK | 10 |
| 2 | 0ms | 3476kb | OK | 10 |
| 3 | Depăşit | 5804kb | Time limit exceeded. | 0 |
| 4 | Depăşit | 6008kb | Time limit exceeded. | 0 |
| 5 | Depăşit | 6012kb | Time limit exceeded. | 0 |
| 6 | Depăşit | 6004kb | Time limit exceeded. | 0 |
| 7 | Depăşit | 6004kb | Time limit exceeded. | 0 |
| 8 | Depăşit | 5872kb | Time limit exceeded. | 0 |
| 9 | Depăşit | 5868kb | Time limit exceeded. | 0 |
| 10 | 0ms | 3404kb | OK | 10 |
| Punctaj total | 30 |