Pagini recente » Borderou de evaluare (job #3239205) | Borderou de evaluare (job #995646) | Borderou de evaluare (job #1340923) | Borderou de evaluare (job #1588995) | Borderou de evaluare (job #2142837)
Borderou de evaluare (job #2142837)
Raport evaluator
Compilare:
user.cpp: In function ‘void dreapta()’:
user.cpp:30:52: warning: array subscript is above array bounds [-Warray-bounds]
if(V[i][j]>V[i][j+1])A[i][j][3]=A[i][j+1][3]+1;
^
user.cpp:30:39: warning: array subscript is above array bounds [-Warray-bounds]
if(V[i][j]>V[i][j+1])A[i][j][3]=A[i][j+1][3]+1;
^
user.cpp: In function ‘void stanga()’:
user.cpp:36:52: warning: array subscript is above array bounds [-Warray-bounds]
if(V[i][j]>V[i][j-1])A[i][j][4]=A[i][j-1][4]+1;
^
user.cpp:36:39: warning: array subscript is above array bounds [-Warray-bounds]
if(V[i][j]>V[i][j-1])A[i][j][4]=A[i][j-1][4]+1;
^
user.cpp: In function ‘int main()’:
user.cpp:47:52: warning: array subscript is above array bounds [-Warray-bounds]
maxim=max(maxim,A[i][j][1]+A[i][j][2]+A[i][j][3]+A[i][j][4]);
^
user.cpp:47:63: warning: array subscript is above array bounds [-Warray-bounds]
maxim=max(maxim,A[i][j][1]+A[i][j][2]+A[i][j][3]+A[i][j][4]);
^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
Punctaj/grupa |
1 | 0ms | 3552kb | OK | 10 | 10 |
2 | 0ms | 3580kb | Incorect | 0 | 0 |
3 | 4ms | 5732kb | Incorect | 0 | 0 |
4 | 4ms | 5736kb | Incorect | 0 | 0 |
5 | 8ms | 5776kb | Incorect | 0 |
6 | 24ms | 9904kb | Incorect | 0 |
7 | 256ms | 16972kb | Incorect | 0 |
8 | 260ms | 17048kb | Incorect | 0 |
9 | 268ms | 17168kb | Incorect | 0 |
10 | 204ms | 17164kb | Incorect | 0 |
Punctaj total | 10 |