Pagini recente »
Borderou de evaluare (job #574217)
|
Borderou de evaluare (job #577892)
|
Borderou de evaluare (job #301368)
|
Borderou de evaluare (job #244833)
|
Borderou de evaluare (job #639534)
Borderou de evaluare (job #639534)
Raport evaluator
Compilare:
main.cpp: In function 'int main()':
main.cpp:94:19: warning: array subscript 4 is above array bounds of 'int [4]' [-Warray-bounds]
94 | if(s[ij][jj][q]-s[is-1][jj][q]-s[ij][js-1][q]+s[is-1][js-1][q]==k+1) return 1;
| ~~~~~~~~~~~^
main.cpp:5:25: note: while referencing 's'
5 | int n,m,C,v[65][65],i,j,s[65][65][4],k,r,pa,l,c,p[65],ij,jj,is,js,ok,t,z=0,zz;
| ^
main.cpp:94:34: warning: array subscript 4 is above array bounds of 'int [4]' [-Warray-bounds]
94 | if(s[ij][jj][q]-s[is-1][jj][q]-s[ij][js-1][q]+s[is-1][js-1][q]==k+1) return 1;
| ~~~~~~~~~~~~~^
main.cpp:5:25: note: while referencing 's'
5 | int n,m,C,v[65][65],i,j,s[65][65][4],k,r,pa,l,c,p[65],ij,jj,is,js,ok,t,z=0,zz;
| ^
main.cpp:94:49: warning: array subscript 4 is above array bounds of 'int [4]' [-Warray-bounds]
94 | if(s[ij][jj][q]-s[is-1][jj][q]-s[ij][js-1][q]+s[is-1][js-1][q]==k+1) return 1;
| ~~~~~~~~~~~~~^
main.cpp:5:25: note: while referencing 's'
5 | int n,m,C,v[65][65],i,j,s[65][65][4],k,r,pa,l,c,p[65],ij,jj,is,js,ok,t,z=0,zz;
| ^
main.cpp:94:66: warning: array subscript 4 is above array bounds of 'int [4]' [-Warray-bounds]
94 | if(s[ij][jj][q]-s[is-1][jj][q]-s[ij][js-1][q]+s[is-1][js-1][q]==k+1) return 1;
| ~~~~~~~~~~~~~~~^
main.cpp:5:25: note: while referencing 's'
5 | int n,m,C,v[65][65],i,j,s[65][65][4],k,r,pa,l,c,p[65],ij,jj,is,js,ok,t,z=0,zz;
| ^
main.cpp:94:19: warning: array subscript 4 is above array bounds of 'int [4]' [-Warray-bounds]
94 | if(s[ij][jj][q]-s[is-1][jj][q]-s[ij][js-1][q]+s[is-1][js-1][q]==k+1) return 1;
| ~~~~~~~~~~~^
main.cpp:5:25: note: while referencing 's'
5 | int n,m,C,v[65][65],i,j,s[65][65][4],k,r,pa,l,c,p[65],ij,jj,is,js,ok,t,z=0,zz;
| ^
main.cpp:94:34: warning: array subscript 4 is above array bounds of 'int [4]' [-Warray-bounds]
94 | if(s[ij][jj][q]-s[is-1][jj][q]-s[ij][js-1][q]+s[is-1][js-1][q]==k+1) return 1;
| ~~~~~~~~~~~~~^
main.cpp:5:25: note: while referencing 's'
5 | int n,m,C,v[65][65],i,j,s[65][65][4],k,r,pa,l,c,p[65],ij,jj,is,js,ok,t,z=0,zz;
| ^
main.cpp:94:49: warning: array subscript 4 is above array bounds of 'int [4]' [-Warray-bounds]
94 | if(s[ij][jj][q]-s[is-1][jj][q]-s[ij][js-1][q]+s[is-1][js-1][q]==k+1) return 1;
| ~~~~~~~~~~~~~^
main.cpp:5:25: note: while referencing 's'
5 | int n,m,C,v[65][65],i,j,s[65][65][4],k,r,pa,l,c,p[65],ij,jj,is,js,ok,t,z=0,zz;
| ^
main.cpp:94:66: warning: array subscript 4 is above array bounds of 'int [4]' [-Warray-bounds]
94 | if(s[ij][jj][q]-s[is-1][jj][q]-s[ij][js-1][q]+s[is-1][js-1][q]==k+1) return 1;
| ~~~~~~~~~~~~~~~^
main.cpp:5:25: note: while referencing 's'
5 | int n,m,C,v[65][65],i,j,s[65][65][4],k,r,pa,l,c,p[65],ij,jj,is,js,ok,t,z=0,zz;
| ^
Test |
Timp execuție |
Memorie folosită |
Mesaj |
Punctaj/test |
1
|
1 ms
|
118 kb
|
Fisier de iesire lipsa
|
0
|
2
|
1 ms
|
118 kb
|
Fisier de iesire lipsa
|
0
|
3
|
1 ms
|
114 kb
|
Fisier de iesire lipsa
|
0
|
4
|
1 ms
|
118 kb
|
Fisier de iesire lipsa
|
0
|
5
|
1 ms
|
118 kb
|
Fisier de iesire lipsa
|
0
|
6
|
1 ms
|
114 kb
|
Fisier de iesire lipsa
|
0
|
7
|
1 ms
|
118 kb
|
Fisier de iesire lipsa
|
0
|
8
|
1 ms
|
114 kb
|
Fisier de iesire lipsa
|
0
|
9
|
1 ms
|
114 kb
|
Fisier de iesire lipsa
|
0
|
10
|
1 ms
|
118 kb
|
Fisier de iesire lipsa
|
0
|
Punctaj total
|
0
|