Pagini recente » Borderou de evaluare (job #604552) | Borderou de evaluare (job #2901418) | Borderou de evaluare (job #640582) | Borderou de evaluare (job #1213367) | Borderou de evaluare (job #2288656)
Borderou de evaluare (job #2288656)
Raport evaluator
Compilare:
main.cpp: In function 'int main()':
main.cpp:35:41: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
freopen("elicoptere.in", "r", stdin);
^
main.cpp:36:43: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
freopen("elicoptere.out", "w", stdout);
^
main.cpp:37:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &T);
^
main.cpp:38:26: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d", &N, &K);
^
main.cpp:39:125: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
for(i=1; i<=N; ++i) {scanf("%f%f%f%f%f%f", &List[i].x1, &List[i].y1, &List[i].x2, &List[i].y2, &List[i].x3, &List[i].y3); D[i][i]=K+1;}
^
| Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
| 1 | 2ms | 131kb | Numar de elicoptere gresit. | 0 |
| 2 | 3ms | 131kb | Numar de elicoptere gresit. | 0 |
| 3 | 4ms | 131kb | Numar de elicoptere gresit. | 0 |
| 4 | 5ms | 131kb | Numar de elicoptere gresit. | 0 |
| 5 | 7ms | 131kb | Numar de elicoptere gresit. | 0 |
| 6 | 9ms | 131kb | Numar de elicoptere gresit. | 0 |
| 7 | 11ms | 131kb | Numar de elicoptere gresit. | 0 |
| 8 | 13ms | 131kb | Numar de elicoptere gresit. | 0 |
| 9 | 16ms | 262kb | Numar de elicoptere gresit. | 0 |
| 10 | 19ms | 262kb | Numar de elicoptere gresit. | 0 |
| 11 | 3ms | 131kb | OK. | 4 |
| 12 | 3ms | 131kb | OK. | 4 |
| 13 | 4ms | 131kb | OK. | 4 |
| 14 | 5ms | 131kb | OK. | 4 |
| 15 | 7ms | 131kb | OK. | 4 |
| 16 | 9ms | 131kb | OK. | 4 |
| 17 | 11ms | 131kb | OK. | 4 |
| 18 | 13ms | 131kb | OK. | 4 |
| 19 | 16ms | 262kb | OK. | 4 |
| 20 | 18ms | 262kb | OK. | 4 |
| 21 | 3ms | 131kb | Suma lungimilor rutelor gresita. | 0 |
| 22 | 3ms | 131kb | Suma lungimilor rutelor gresita. | 0 |
| 23 | 4ms | 131kb | Suma lungimilor rutelor gresita. | 0 |
| 24 | 5ms | 131kb | Suma lungimilor rutelor gresita. | 0 |
| 25 | 7ms | 131kb | Suma lungimilor rutelor gresita. | 0 |
| 26 | 9ms | 131kb | Suma lungimilor rutelor gresita. | 0 |
| 27 | 12ms | 131kb | Suma lungimilor rutelor gresita. | 0 |
| 28 | 13ms | 131kb | Suma lungimilor rutelor gresita. | 0 |
| 29 | 16ms | 262kb | Suma lungimilor rutelor gresita. | 0 |
| 30 | 19ms | 262kb | Suma lungimilor rutelor gresita. | 0 |
| Punctaj total | 40 |