Pagini recente » Borderou de evaluare (job #1898471) | Borderou de evaluare (job #672934) | Borderou de evaluare (job #319183) | Borderou de evaluare (job #1258565) | Borderou de evaluare (job #2534063)
Borderou de evaluare (job #2534063)
Raport evaluator
Compilare:
main.cpp: In function 'int main()':
main.cpp:18:24: warning: array subscript is above array bounds [-Warray-bounds]
best[1][1]=1; best[1][2]=1;
~~~~~~~~~^
main.cpp:23:90: warning: array subscript is above array bounds [-Warray-bounds]
if(best[j][1]+1>best[i][1]&&v[j]<v[i]) {best[i][1]=best[j][1]+1; best[i][2]=best[j][2];}
~~~~~~~~~^
main.cpp:23:79: warning: array subscript is above array bounds [-Warray-bounds]
if(best[j][1]+1>best[i][1]&&v[j]<v[i]) {best[i][1]=best[j][1]+1; best[i][2]=best[j][2];}
~~~~~~~~~^
main.cpp:24:71: warning: array subscript is above array bounds [-Warray-bounds]
else if(best[j][1]+1==best[i][1]&&v[j]<v[i]) best[i][2]=(best[i][2]+best[j][2])%9901;
~~~~~~~~~^
main.cpp:24:82: warning: array subscript is above array bounds [-Warray-bounds]
else if(best[j][1]+1==best[i][1]&&v[j]<v[i]) best[i][2]=(best[i][2]+best[j][2])%9901;
~~~~~~~~~^
main.cpp:24:59: warning: array subscript is above array bounds [-Warray-bounds]
else if(best[j][1]+1==best[i][1]&&v[j]<v[i]) best[i][2]=(best[i][2]+best[j][2])%9901;
~~~~~~~~~^
main.cpp:26:45: warning: array subscript is above array bounds [-Warray-bounds]
if(best[i][1]==0) {best[i][1]=1; best[i][2]=1;}
~~~~~~~~~^
main.cpp:27:56: warning: array subscript is above array bounds [-Warray-bounds]
if(best[i][1]>mare) {mare=best[i][1]; maxim=best[i][2];}
~~~~~~~~~^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 2ms | 131kb | Incorect | 0 |
2 | 2ms | 131kb | OK | 10 |
3 | 2ms | 131kb | OK | 10 |
4 | 2ms | 131kb | Incorect | 0 |
5 | 3ms | 131kb | OK | 10 |
6 | 3ms | 131kb | Incorect | 0 |
7 | 3ms | 131kb | Incorect | 0 |
8 | 3ms | 131kb | OK | 10 |
9 | 7ms | 131kb | OK | 10 |
10 | 5ms | 131kb | OK | 10 |
Punctaj total | 60 |