Borderou de evaluare (job #1900412)

Utilizator tamionvTamio Vesa Nakajima tamionv Data 3 martie 2017 12:56:34
Problema Palalila2 Status done
Runda Arhiva de probleme Compilator cpp | Vezi sursa
Scor 100

Raport evaluator

Compilare: user.cpp: In function ‘int main()’: user.cpp:20:46: warning: suggest parentheses around arithmetic in operand of ‘^’ [-Wparentheses] d1[i&1][j] = max(d1[i&1][j], d1[i&1^1][j]); ^ user.cpp:21:78: warning: suggest parentheses around arithmetic in operand of ‘^’ [-Wparentheses] if(j+1 < 2 * 26 && j == str[i]) d1[i&1][j] = max(d1[i&1][j], d2[i&1^1][j+1] + 1); ^ user.cpp:25:46: warning: suggest parentheses around arithmetic in operand of ‘^’ [-Wparentheses] d2[i&1][j] = max(d2[i&1][j], d2[i&1^1][j]); ^ user.cpp:27:74: warning: suggest parentheses around arithmetic in operand of ‘^’ [-Wparentheses] if(j-1 >= 0 && j == str[i]) d2[i&1][j] = max(d2[i&1][j], d1[i&1^1][j-1] + 1); } } ^ user.cpp:28:18: warning: suggest parentheses around arithmetic in operand of ‘^’ [-Wparentheses] g << max(d1[n&1^1][2*26-1], d2[n&1^1][0]) << endl; ^ user.cpp:28:37: warning: suggest parentheses around arithmetic in operand of ‘^’ [-Wparentheses] g << max(d1[n&1^1][2*26-1], d2[n&1^1][0]) << endl; ^
Test Timp executie Memorie folosita Mesaj Punctaj/test
10ms412kbOK10
20ms416kbOK10
30ms412kbOK10
40ms420kbOK10
54ms424kbOK10
612ms428kbOK10
776ms512kbOK10
8280ms760kbOK10
9400ms904kbOK10
10400ms904kbOK10
Punctaj total100

Ceva nu functioneaza?