Pagini recente » Borderou de evaluare (job #2409938) | Borderou de evaluare (job #1163722) | Borderou de evaluare (job #1361252) | Borderou de evaluare (job #1409474) | Borderou de evaluare (job #1275871)
Borderou de evaluare (job #1275871)
Raport evaluator
Eroare de compilare:
user.cpp: In function ‘int main()’:
user.cpp:107:33: error: ‘tie’ was not declared in this scope
tie(X[i], Y[i], R[i]) = make_tuple(X[N], Y[N], R[N]);
^
user.cpp:107:64: error: ‘make_tuple’ was not declared in this scope
tie(X[i], Y[i], R[i]) = make_tuple(X[N], Y[N], R[N]);
^
user.cpp:113:9: warning: unused variable ‘cntInter’ [-Wunused-variable]
int cntInter = 0, F = 0;
^
user.cpp:89:35: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
freopen("cerc.in", "r", stdin);
^
user.cpp:90:37: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
freopen("cerc.out", "w", stdout);
^
user.cpp:93:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &N);
^
user.cpp:96:45: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d%d", &X[i], &Y[i], &R[i]);
^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 0ms | 288kb | OK | 5 |
2 | 0ms | 292kb | Incorect | 0 |
3 | 0ms | 292kb | Incorect | 0 |
4 | 0ms | 300kb | Incorect | 0 |
5 | 0ms | 292kb | OK | 5 |
6 | 0ms | 284kb | OK | 5 |
7 | 0ms | 288kb | OK | 5 |
8 | 0ms | 288kb | OK | 5 |
9 | 0ms | 292kb | OK | 5 |
10 | 0ms | 292kb | OK | 5 |
11 | 0ms | 304kb | OK | 5 |
12 | 0ms | 292kb | OK | 5 |
13 | 0ms | 312kb | OK | 5 |
14 | 0ms | 292kb | OK | 5 |
15 | 0ms | 292kb | Incorect | 0 |
16 | 0ms | 288kb | OK | 5 |
17 | 0ms | 296kb | Incorect | 0 |
18 | 4ms | 328kb | OK | 5 |
19 | 4ms | 324kb | OK | 5 |
20 | 4ms | 292kb | OK | 5 |
Punctaj total | 0 |