Pagini recente » Borderou de evaluare (job #1745951) | Borderou de evaluare (job #1524507) | Borderou de evaluare (job #177700) | Borderou de evaluare (job #1779891) | Borderou de evaluare (job #1202857)
Borderou de evaluare (job #1202857)
Raport evaluator
Compilare:
user.cpp: In function ‘int main()’:
user.cpp:25:51: warning: suggest parentheses around comparison in operand of ‘&’ [-Wparentheses]
else t[i&1][j]=(1LL*(j+1)*t[(i&1==1)?(0):(1)][j+1]+1LL*(i-j-1)*t[(i&1==1)?(0):(1)][j])op+(((j>=1)?(t[(i&1==1)?(0):(1)][j-1]):(0)))op;
^
user.cpp:25:88: warning: suggest parentheses around comparison in operand of ‘&’ [-Wparentheses]
else t[i&1][j]=(1LL*(j+1)*t[(i&1==1)?(0):(1)][j+1]+1LL*(i-j-1)*t[(i&1==1)?(0):(1)][j])op+(((j>=1)?(t[(i&1==1)?(0):(1)][j-1]):(0)))op;
^
user.cpp:25:124: warning: suggest parentheses around comparison in operand of ‘&’ [-Wparentheses]
else t[i&1][j]=(1LL*(j+1)*t[(i&1==1)?(0):(1)][j+1]+1LL*(i-j-1)*t[(i&1==1)?(0):(1)][j])op+(((j>=1)?(t[(i&1==1)?(0):(1)][j-1]):(0)))op;
^
user.cpp:33:42: warning: suggest parentheses around comparison in operand of ‘&’ [-Wparentheses]
t[i&1][j]=(1LL*(j+1)*t[(i&1==1)?(0):(1)][j+1]+1LL*(i-j-1)*t[(i&1==1)?(0):(1)][j])op+(((j>=1)?(t[(i&1==1)?(0):(1)][j-1]):(0)))op;
^
user.cpp:33:79: warning: suggest parentheses around comparison in operand of ‘&’ [-Wparentheses]
t[i&1][j]=(1LL*(j+1)*t[(i&1==1)?(0):(1)][j+1]+1LL*(i-j-1)*t[(i&1==1)?(0):(1)][j])op+(((j>=1)?(t[(i&1==1)?(0):(1)][j-1]):(0)))op;
^
user.cpp:33:115: warning: suggest parentheses around comparison in operand of ‘&’ [-Wparentheses]
t[i&1][j]=(1LL*(j+1)*t[(i&1==1)?(0):(1)][j+1]+1LL*(i-j-1)*t[(i&1==1)?(0):(1)][j])op+(((j>=1)?(t[(i&1==1)?(0):(1)][j-1]):(0)))op;
^
user.cpp:40:42: warning: suggest parentheses around comparison in operand of ‘&’ [-Wparentheses]
t[i&1][j]=(1LL*(j+1)*t[(i&1==1)?(0):(1)][j+1]+1LL*(i-j-1)*t[(i&1==1)?(0):(1)][j])op+(((j>=1)?(t[(i&1==1)?(0):(1)][j-1]):(0)))op;
^
user.cpp:40:79: warning: suggest parentheses around comparison in operand of ‘&’ [-Wparentheses]
t[i&1][j]=(1LL*(j+1)*t[(i&1==1)?(0):(1)][j+1]+1LL*(i-j-1)*t[(i&1==1)?(0):(1)][j])op+(((j>=1)?(t[(i&1==1)?(0):(1)][j-1]):(0)))op;
^
user.cpp:40:115: warning: suggest parentheses around comparison in operand of ‘&’ [-Wparentheses]
t[i&1][j]=(1LL*(j+1)*t[(i&1==1)?(0):(1)][j+1]+1LL*(i-j-1)*t[(i&1==1)?(0):(1)][j])op+(((j>=1)?(t[(i&1==1)?(0):(1)][j-1]):(0)))op;
^
user.cpp:18:32: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
freopen( IN , "r" , stdin );
^
user.cpp:19:34: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
freopen( OUT , "w" , stdout );
^
user.cpp:20:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&n,&k);
^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 128ms | 300kb | OK | 10 |
2 | 128ms | 292kb | OK | 10 |
3 | 4ms | 292kb | OK | 10 |
4 | 12ms | 288kb | OK | 10 |
5 | 128ms | 296kb | OK | 10 |
6 | 36ms | 292kb | OK | 10 |
7 | 0ms | 296kb | OK | 10 |
8 | 24ms | 280kb | OK | 10 |
9 | 0ms | 272kb | OK | 10 |
10 | 0ms | 268kb | OK | 10 |
Punctaj total | 100 |