Pagini recente » Borderou de evaluare (job #1701893) | Borderou de evaluare (job #1672778) | Borderou de evaluare (job #1411747) | Borderou de evaluare (job #2922620) | Borderou de evaluare (job #1658474)
Borderou de evaluare (job #1658474)
Raport evaluator
Compilare:
user.cpp: In function ‘void Euler(int, int)’:
user.cpp:99:33: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=0; i<G[node].size(); ++i)
^
user.cpp: In function ‘void read()’:
user.cpp:109:36: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
freopen("atac.in", "rt", stdin);
^
user.cpp:110:38: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
freopen("atac.out", "wt", stdout);
^
user.cpp:111:32: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d%d", &N, &M, &P);
^
user.cpp:122:30: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d", &a, &v);
^
user.cpp:126:50: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d%d%d%d%d", &x, &y, &A, &B, &C, &D);
^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 4ms | 5224kb | esti tare! dar abia astept sa vad ce faci pe testele mari | 10 |
2 | 4ms | 5224kb | esti tare! dar abia astept sa vad ce faci pe testele mari | 10 |
3 | 124ms | 5536kb | esti tare! dar abia astept sa vad ce faci pe testele mari | 10 |
4 | 124ms | 5536kb | esti tare! dar abia astept sa vad ce faci pe testele mari | 10 |
5 | 276ms | 17976kb | oho! ai bifat solutia ;) | 10 |
6 | 276ms | 17976kb | oho! ai bifat solutia ;) | 10 |
7 | 280ms | 17968kb | oho! ai bifat solutia ;) | 10 |
8 | 604ms | 17976kb | oho! ai bifat solutia ;) | 10 |
9 | 604ms | 18536kb | oho! ai bifat solutia ;) | 10 |
10 | 492ms | 18436kb | oho! ai bifat solutia ;) | 10 |
Punctaj total | 100 |