Pagini recente » Borderou de evaluare (job #1635702) | Borderou de evaluare (job #1584491) | Borderou de evaluare (job #2771685) | Borderou de evaluare (job #1137397) | Borderou de evaluare (job #1584487)
Borderou de evaluare (job #1584487)
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:110:58: warning: array subscript is above array bounds [-Warray-bounds]
if(unghiuriEchivalente(uaux, unghi2) && drum[k][2] == 0)
^
user.cpp:111: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:89: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:89: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:90: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:90: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 | 468kb | Primul numar corect | 1 |
| 2 | 0ms | 520kb | Primul numar corect | 1 |
| 3 | 0ms | 644kb | Primul numar corect | 1 |
| 4 | 8ms | 1256kb | Primul numar corect | 1 |
| 5 | 8ms | 1544kb | Primul numar corect | 1 |
| 6 | 32ms | 2440kb | Primul numar corect | 1 |
| 7 | 0ms | 892kb | Primul numar corect | 1 |
| 8 | 0ms | 616kb | Primul numar corect | 1 |
| 9 | 12ms | 1712kb | Primul numar corect | 1 |
| 10 | 44ms | 4344kb | Primul numar corect | 1 |
| 11 | 56ms | 4344kb | Primul numar corect | 1 |
| 12 | 148ms | 5664kb | OK | 5 |
| 13 | 160ms | 6620kb | Primul numar corect | 1 |
| 14 | 196ms | 7392kb | Primul numar corect | 1 |
| 15 | 160ms | 8256kb | Primul numar corect | 1 |
| 16 | 180ms | 8260kb | Primul numar corect | 1 |
| 17 | 124ms | 6624kb | Primul numar corect | 1 |
| 18 | 224ms | 8268kb | Primul numar corect | 1 |
| 19 | 128ms | 5648kb | Primul numar corect | 1 |
| 20 | 204ms | 8260kb | Primul numar corect | 1 |
| Punctaj total | 24 |