Pagini recente » Borderou de evaluare (job #1968674) | Borderou de evaluare (job #1949140) | Borderou de evaluare (job #2749184) | Borderou de evaluare (job #1629693) | Borderou de evaluare (job #1170457)
Borderou de evaluare (job #1170457)
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: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 |
1 | 24ms | 2612kb | Incorect | 0 |
2 | 24ms | 2608kb | Incorect | 0 |
3 | 24ms | 2612kb | Incorect | 0 |
4 | 812ms | 36536kb | Killed by signal 11(SIGSEGV). | 0 |
5 | 820ms | 36540kb | Killed by signal 11(SIGSEGV). | 0 |
6 | 824ms | 36544kb | Killed by signal 11(SIGSEGV). | 0 |
7 | 512ms | 36524kb | Killed by signal 11(SIGSEGV). | 0 |
8 | 512ms | 36528kb | Killed by signal 11(SIGSEGV). | 0 |
9 | 508ms | 36528kb | Killed by signal 11(SIGSEGV). | 0 |
10 | 508ms | 36528kb | Killed by signal 11(SIGSEGV). | 0 |
Punctaj total | 0 |