Borderou de evaluare (job #1623368)

Utilizator dumbraveanbDumbravean Bogdan dumbraveanb Data 1 martie 2016 19:02:47
Problema Vis Status done
Runda Arhiva de probleme Compilator cpp | Vezi sursa
Scor 40

Raport evaluator

Compilare: user.cpp: In function ‘void Lee(int (*)[1002], int, int, int, int, int, int, int)’: user.cpp:33:110: warning: suggest parentheses around ‘&&’ within ‘||’ [-Wparentheses] if(Ins(in, jn) && B[in][jn] == 0 && (A[in][jn] == 0 || ok1 < 20 && (A[in][jn] <= k1 || ok1 == 12 && A[in][jn] >= k2) || ok1 > 20 && (A[in][jn] >= k2 || ok1 == 22 && A[in][jn] <= k1))){ ^ user.cpp:33:77: warning: suggest parentheses around ‘&&’ within ‘||’ [-Wparentheses] if(Ins(in, jn) && B[in][jn] == 0 && (A[in][jn] == 0 || ok1 < 20 && (A[in][jn] <= k1 || ok1 == 12 && A[in][jn] >= k2) || ok1 > 20 && (A[in][jn] >= k2 || ok1 == 22 && A[in][jn] <= k1))){ ^ user.cpp:33:175: warning: suggest parentheses around ‘&&’ within ‘||’ [-Wparentheses] if(Ins(in, jn) && B[in][jn] == 0 && (A[in][jn] == 0 || ok1 < 20 && (A[in][jn] <= k1 || ok1 == 12 && A[in][jn] >= k2) || ok1 > 20 && (A[in][jn] >= k2 || ok1 == 22 && A[in][jn] <= k1))){ ^ user.cpp:33:142: warning: suggest parentheses around ‘&&’ within ‘||’ [-Wparentheses] if(Ins(in, jn) && B[in][jn] == 0 && (A[in][jn] == 0 || ok1 < 20 && (A[in][jn] <= k1 || ok1 == 12 && A[in][jn] >= k2) || ok1 > 20 && (A[in][jn] >= k2 || ok1 == 22 && A[in][jn] <= k1))){ ^ user.cpp: In function ‘int main()’: user.cpp:59:19: warning: suggest explicit braces to avoid ambiguous ‘else’ [-Wparentheses] if(in == l1 && jn == c1 && !ok1) if(!ok2) ok1 = 11; else ok1 = 12; ^ user.cpp:60:19: warning: suggest explicit braces to avoid ambiguous ‘else’ [-Wparentheses] if(in == l2 && jn == c2 && !ok2) if(!ok1) ok2 = 21; else ok2 = 22; ^
Test Timp executie Memorie folosita Mesaj Punctaj/test
10ms468kbIncorect0
20ms536kbIncorect0
30ms1020kbOK10
4108ms8276kbOK10
5104ms8272kbIncorect0
6152ms9840kbIncorect0
7220ms11400kbOK10
8220ms8280kbIncorect0
9396ms16108kbOK10
100ms1172kbIncorect0
Punctaj total40

Ceva nu functioneaza?