Pagini recente » Borderou de evaluare (job #2658390) | Borderou de evaluare (job #2120336) | Borderou de evaluare (job #853508) | Borderou de evaluare (job #2096303) | Borderou de evaluare (job #2481338)
Borderou de evaluare (job #2481338)
Raport evaluator
Compilare:
main.cpp: In function 'void Bordare()':
main.cpp:15:12: warning: unused variable 'j' [-Wunused-variable]
int i, j;
^
main.cpp: In function 'int main()':
main.cpp:54:46: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
else if(F[i - 1][j] == 1 && A[i][j] < H || F[i + 1][j] == 1 && A[i][j] < H || F[i][j - 1] == 1 && A[i][j] < H || F[i][j + 1] == 1 && A[i][j] < H)
~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
main.cpp:54:116: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
else if(F[i - 1][j] == 1 && A[i][j] < H || F[i + 1][j] == 1 && A[i][j] < H || F[i][j - 1] == 1 && A[i][j] < H || F[i][j + 1] == 1 && A[i][j] < H)
~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
main.cpp:54:151: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
else if(F[i - 1][j] == 1 && A[i][j] < H || F[i + 1][j] == 1 && A[i][j] < H || F[i][j - 1] == 1 && A[i][j] < H || F[i][j + 1] == 1 && A[i][j] < H)
~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
| Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
| 1 | 2ms | 262kb | Incorect | 0 |
| 2 | 4ms | 524kb | Incorect | 0 |
| 3 | 130ms | 4194kb | Killed by Signal 11 | 0 |
| 4 | 19ms | 2338kb | Incorect | 0 |
| 5 | 51ms | 2129kb | Incorect | 0 |
| 6 | 171ms | 7712kb | Incorect | 0 |
| 7 | 206ms | 4149kb | Killed by Signal 11 | 0 |
| 8 | 87ms | 4173kb | Incorect | 0 |
| 9 | 138ms | 4153kb | Killed by Signal 11 | 0 |
| 10 | 221ms | 4091kb | Killed by Signal 11 | 0 |
| Punctaj total | 0 |
Lungeanu Razvan Parutix