Pagini recente » Cod sursa (job #939823) | Borderou de evaluare (job #166588) | Borderou de evaluare (job #1870129) | Borderou de evaluare (job #2500912) | Borderou de evaluare (job #1584486)
Borderou de evaluare (job #1584486)
Raport evaluator
Compilare:
user.cpp: In function ‘int main()’:
user.cpp:41:26: warning: ignoring return value of ‘int fscanf(FILE*, const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
fscanf(fin, "%d", &n);
^
user.cpp:42:98: warning: ignoring return value of ‘int fscanf(FILE*, const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
fscanf(fin, "%d%d%d%d%d%d%d%d%d%d", &tx, &ty, &s1x, &s1y, &s2x, &s2y, &r1x, &r1y, &r2x, &r2y);
^
user.cpp:43:26: warning: ignoring return value of ‘int fscanf(FILE*, const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
fscanf(fin, "%d", &k);
^
user.cpp:45:36: warning: ignoring return value of ‘int fscanf(FILE*, const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
fscanf(fin, "%d%d", &x, &y);
^
user.cpp: In function ‘void lee(int, int, int, int)’:
user.cpp:107:58: warning: array subscript is above array bounds [-Warray-bounds]
if(unghiuriEchivalente(uaux, unghi2) && drum[k][2] == 0)
^
user.cpp:108:22: warning: array subscript is above array bounds [-Warray-bounds]
drum[k][2] = mat[x][y].drum;
^
user.cpp: In function ‘int main()’:
user.cpp:86:33: warning: array subscript is above array bounds [-Warray-bounds]
x = (drum[1][1] >= drum[2][2]) ? drum[1][1] : drum[2][2];
^
user.cpp:86:30: warning: array subscript is above array bounds [-Warray-bounds]
x = (drum[1][1] >= drum[2][2]) ? drum[1][1] : drum[2][2];
^
user.cpp:87:19: warning: array subscript is above array bounds [-Warray-bounds]
y = (drum[1][2] >= drum[2][1]) ? drum[1][2] : drum[2][1];
^
user.cpp:87:30: warning: array subscript is above array bounds [-Warray-bounds]
y = (drum[1][2] >= drum[2][1]) ? drum[1][2] : drum[2][1];
^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 0ms | 472kb | Primul numar corect | 1 |
2 | 0ms | 516kb | Primul numar corect | 1 |
3 | 0ms | 648kb | Primul numar corect | 1 |
4 | 4ms | 1256kb | Primul numar corect | 1 |
5 | 8ms | 1536kb | Primul numar corect | 1 |
6 | 20ms | 2440kb | Primul numar corect | 1 |
7 | 0ms | 892kb | Primul numar corect | 1 |
8 | 0ms | 620kb | Primul numar corect | 1 |
9 | 8ms | 1708kb | Primul numar corect | 1 |
10 | 24ms | 4348kb | Primul numar corect | 1 |
11 | 36ms | 4352kb | Primul numar corect | 1 |
12 | 116ms | 5660kb | OK | 5 |
13 | 104ms | 6620kb | Primul numar corect | 1 |
14 | 124ms | 7388kb | Primul numar corect | 1 |
15 | 88ms | 8256kb | Primul numar corect | 1 |
16 | 96ms | 8260kb | Primul numar corect | 1 |
17 | 72ms | 6628kb | Primul numar corect | 1 |
18 | 136ms | 8260kb | Primul numar corect | 1 |
19 | 88ms | 5652kb | Primul numar corect | 1 |
20 | 128ms | 8004kb | Primul numar corect | 1 |
Punctaj total | 24 |