Borderou de evaluare (job #1170454)

Utilizator pop_bogdanBogdan Pop pop_bogdan Data 13 aprilie 2014 17:37:12
Problema Euclid Status done
Runda Arhiva de probleme Compilator cpp | Vezi sursa
Scor 0

Raport evaluator

Compilare: user.cpp: In function ‘void Solve()’: user.cpp:35:28: warning: suggest parentheses around ‘+’ inside ‘<<’ [-Wparentheses] for ( int i = 1; i + 1 << (k1-1) <= N+1; ++i ) ^ user.cpp:38:69: warning: suggest parentheses around ‘+’ inside ‘<<’ [-Wparentheses] D[k1][0][i][j] = __gcd(D[k1-1][0][i][j],D[k1-1][0][i+1<<(k1-1)][j]); ^ user.cpp:45:32: warning: suggest parentheses around ‘+’ inside ‘<<’ [-Wparentheses] for ( int j = 1; j + 1 << ( k2 - 1) <= M+1; ++j ) ^ user.cpp:46:72: warning: suggest parentheses around ‘+’ inside ‘<<’ [-Wparentheses] D[0][k2][i][j] = __gcd(D[0][k2-1][i][j],D[0][k2-1][i][j+1<<(k2-1)]); ^ user.cpp:55:89: warning: suggest parentheses around ‘+’ inside ‘<<’ [-Wparentheses] D[k1][k2][i][j] = __gcd(__gcd(D[k1-1][k2-1][i][j],D[k1-1][k2-1][i][j+1<<(k2-1)]),__gcd(D[k1-1][k2-1][i+1<<(k1-1)][j],D[k1-1][k2-1][i+1<<(k1-1)][j+1<<(k2-1)])); ^ user.cpp:55:123: warning: suggest parentheses around ‘+’ inside ‘<<’ [-Wparentheses] D[k1][k2][i][j] = __gcd(__gcd(D[k1-1][k2-1][i][j],D[k1-1][k2-1][i][j+1<<(k2-1)]),__gcd(D[k1-1][k2-1][i+1<<(k1-1)][j],D[k1-1][k2-1][i+1<<(k1-1)][j+1<<(k2-1)])); ^ user.cpp:55:153: warning: suggest parentheses around ‘+’ inside ‘<<’ [-Wparentheses] D[k1][k2][i][j] = __gcd(__gcd(D[k1-1][k2-1][i][j],D[k1-1][k2-1][i][j+1<<(k2-1)]),__gcd(D[k1-1][k2-1][i+1<<(k1-1)][j],D[k1-1][k2-1][i+1<<(k1-1)][j+1<<(k2-1)])); ^ user.cpp:55:166: warning: suggest parentheses around ‘+’ inside ‘<<’ [-Wparentheses] D[k1][k2][i][j] = __gcd(__gcd(D[k1-1][k2-1][i][j],D[k1-1][k2-1][i][j+1<<(k2-1)]),__gcd(D[k1-1][k2-1][i+1<<(k1-1)][j],D[k1-1][k2-1][i+1<<(k1-1)][j+1<<(k2-1)])); ^ user.cpp:68:70: warning: suggest parentheses around ‘-’ inside ‘<<’ [-Wparentheses] if ( maxim < __gcd(__gcd(D[k1][k2][i][j],D[k1][k2][i][j+W-1<<k2]),__gcd(D[k1][k2][i+H-1<<k1][j],D[k1][k2][i+H-1<<k1][j+W-1<<k2]))) ^ user.cpp:68:98: warning: suggest parentheses around ‘-’ inside ‘<<’ [-Wparentheses] if ( maxim < __gcd(__gcd(D[k1][k2][i][j],D[k1][k2][i][j+W-1<<k2]),__gcd(D[k1][k2][i+H-1<<k1][j],D[k1][k2][i+H-1<<k1][j+W-1<<k2]))) ^ user.cpp:68:122: warning: suggest parentheses around ‘-’ inside ‘<<’ [-Wparentheses] if ( maxim < __gcd(__gcd(D[k1][k2][i][j],D[k1][k2][i][j+W-1<<k2]),__gcd(D[k1][k2][i+H-1<<k1][j],D[k1][k2][i+H-1<<k1][j+W-1<<k2]))) ^ user.cpp:68:133: warning: suggest parentheses around ‘-’ inside ‘<<’ [-Wparentheses] if ( maxim < __gcd(__gcd(D[k1][k2][i][j],D[k1][k2][i][j+W-1<<k2]),__gcd(D[k1][k2][i+H-1<<k1][j],D[k1][k2][i+H-1<<k1][j+W-1<<k2]))) ^ user.cpp:69:69: warning: suggest parentheses around ‘-’ inside ‘<<’ [-Wparentheses] maxim = __gcd(__gcd(D[k1][k2][i][j],D[k1][k2][i][j+W-1<<k2]),__gcd(D[k1][k2][i+H-1<<k1][j],D[k1][k2][i+H-1<<k1][j+W-1<<k2])); ^ user.cpp:69:97: warning: suggest parentheses around ‘-’ inside ‘<<’ [-Wparentheses] maxim = __gcd(__gcd(D[k1][k2][i][j],D[k1][k2][i][j+W-1<<k2]),__gcd(D[k1][k2][i+H-1<<k1][j],D[k1][k2][i+H-1<<k1][j+W-1<<k2])); ^ user.cpp:69:121: warning: suggest parentheses around ‘-’ inside ‘<<’ [-Wparentheses] maxim = __gcd(__gcd(D[k1][k2][i][j],D[k1][k2][i][j+W-1<<k2]),__gcd(D[k1][k2][i+H-1<<k1][j],D[k1][k2][i+H-1<<k1][j+W-1<<k2])); ^ user.cpp:69:132: warning: suggest parentheses around ‘-’ inside ‘<<’ [-Wparentheses] maxim = __gcd(__gcd(D[k1][k2][i][j],D[k1][k2][i][j+W-1<<k2]),__gcd(D[k1][k2][i+H-1<<k1][j],D[k1][k2][i+H-1<<k1][j+W-1<<k2])); ^
Test Timp executie Memorie folosita Mesaj Punctaj/test
124ms2816kbIncorect0
224ms2820kbIncorect0
324ms2812kbIncorect0
4784ms37252kbKilled by signal 11(SIGSEGV).0
5784ms37252kbKilled by signal 11(SIGSEGV).0
6788ms37248kbKilled by signal 11(SIGSEGV).0
7488ms37240kbKilled by signal 11(SIGSEGV).0
8488ms37240kbKilled by signal 11(SIGSEGV).0
9488ms37236kbKilled by signal 11(SIGSEGV).0
10488ms37236kbKilled by signal 11(SIGSEGV).0
Punctaj total0

Ceva nu functioneaza?