Pagini recente » Borderou de evaluare (job #2630281) | Borderou de evaluare (job #764865) | Borderou de evaluare (job #65766) | Borderou de evaluare (job #1077178) | Borderou de evaluare (job #1658887)
Borderou de evaluare (job #1658887)
Raport evaluator
Compilare:
user.cpp: In function ‘void Normalize()’:
user.cpp:21:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=2;i<=n;++i)
^
user.cpp: In function ‘int main()’:
user.cpp:35:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(i=1;i<=n;++i)
^
user.cpp:41:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(i=2;i<=n;++i)
^
user.cpp:3:18: warning: left shift count >= width of type [enabled by default]
#define MOD (1u<<32)
^
user.cpp:51:36: note: in expansion of macro ‘MOD’
if(val<0) val+=MOD;
^
user.cpp:3:18: warning: left shift count >= width of type [enabled by default]
#define MOD (1u<<32)
^
user.cpp:55:21: note: in expansion of macro ‘MOD’
if(sol>=MOD) sol-=MOD;
^
user.cpp:3:18: warning: left shift count >= width of type [enabled by default]
#define MOD (1u<<32)
^
user.cpp:55:31: note: in expansion of macro ‘MOD’
if(sol>=MOD) sol-=MOD;
^
user.cpp:3:18: warning: left shift count >= width of type [enabled by default]
#define MOD (1u<<32)
^
user.cpp:57:30: note: in expansion of macro ‘MOD’
if(sum[i][a[j]]>=MOD) sum[i][a[j]]-=MOD;
^
user.cpp:3:18: warning: left shift count >= width of type [enabled by default]
#define MOD (1u<<32)
^
user.cpp:57:49: note: in expansion of macro ‘MOD’
if(sum[i][a[j]]>=MOD) sum[i][a[j]]-=MOD;
^
user.cpp:59:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(j=2;j<=maxx;++j)
^
user.cpp:3:18: warning: left shift count >= width of type [enabled by default]
#define MOD (1u<<32)
^
user.cpp:62:27: note: in expansion of macro ‘MOD’
if(sum[i][j]>=MOD) sum[i][j]-=MOD;
^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 0ms | 504kb | OK | 10 |
2 | 0ms | 744kb | OK | 10 |
3 | 0ms | 1024kb | OK | 10 |
4 | 12ms | 4808kb | Incorect | 0 |
5 | 32ms | 8296kb | Incorect | 0 |
6 | 32ms | 8484kb | Incorect | 0 |
7 | 112ms | 15348kb | OK | 10 |
8 | 124ms | 16040kb | OK | 10 |
9 | 88ms | 13520kb | Incorect | 0 |
10 | 124ms | 16132kb | Incorect | 0 |
Punctaj total | 50 |