Pagini recente » Borderou de evaluare (job #786115) | Borderou de evaluare (job #2627816) | Borderou de evaluare (job #2241711) | Borderou de evaluare (job #2142833) | Borderou de evaluare (job #2337291)
Borderou de evaluare (job #2337291)
Raport evaluator
Compilare:
main.cpp: In function 'int main()':
main.cpp:43:24: warning: array subscript is above array bounds [-Warray-bounds]
cub[i][j][2]=2*n*n+1-k;
~~~~~~~~~~~^
main.cpp:58:28: warning: array subscript is above array bounds [-Warray-bounds]
cub[j][n-i+1][2]=2*n*n+1-k;
~~~~~~~~~~~~~~~^
main.cpp:73:28: warning: array subscript is above array bounds [-Warray-bounds]
cub[n-i+1][j][2]=2*n*n+1-k;
~~~~~~~~~~~~~~~^
main.cpp:88:24: warning: array subscript is above array bounds [-Warray-bounds]
cub[j][i][2]=2*n*n+1-k;
~~~~~~~~~~~^
main.cpp:114:30: warning: array subscript is above array bounds [-Warray-bounds]
for(int j=cub[1][i][2];j<=n*n*n;j+=n*n*2){
~~~~~~~~~~~^
main.cpp:126:30: warning: array subscript is above array bounds [-Warray-bounds]
for(int j=cub[i][n][2];j<=n*n*n;j+=n*n*2){
~~~~~~~~~~~^
main.cpp:138:30: warning: array subscript is above array bounds [-Warray-bounds]
for(int j=cub[n][i][2];j<=n*n*n;j+=n*n*2){
~~~~~~~~~~~^
main.cpp:150:30: warning: array subscript is above array bounds [-Warray-bounds]
for(int j=cub[i][1][2];j<=n*n*n;j+=n*n*2){
~~~~~~~~~~~^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 2ms | 131kb | Corect | 2 |
2 | 2ms | 131kb | Corect | 2 |
3 | 2ms | 131kb | Corect | 2 |
4 | 2ms | 262kb | Corect | 2 |
5 | 3ms | 262kb | Corect | 2 |
6 | 3ms | 262kb | Corect | 2 |
7 | 3ms | 393kb | Corect | 2 |
8 | 3ms | 393kb | Corect | 2 |
9 | 3ms | 393kb | Corect | 2 |
10 | 3ms | 524kb | Corect | 2 |
11 | 2ms | 131kb | Corect | 8 |
12 | 2ms | 131kb | Corect | 8 |
13 | 3ms | 262kb | Corect | 8 |
14 | 5ms | 262kb | Corect | 8 |
15 | 9ms | 262kb | Corect | 8 |
16 | 35ms | 655kb | Corect | 8 |
17 | 55ms | 786kb | Corect | 8 |
18 | 83ms | 1048kb | Corect | 8 |
19 | 99ms | 1179kb | Corect | 8 |
20 | 134ms | 1441kb | Corect | 8 |
Punctaj total | 100 |