Borderou de evaluare (job #3191586)
Utilizator | Data | 10 ianuarie 2024 01:37:15 | |
---|---|---|---|
Problema | Segmente | Status | done |
Runda | Arhiva de probleme | Compilator | cpp-64 | Vezi sursa |
Scor | 0 |
Raport evaluator
Eroare de compilare:
main.cpp: In member function 'double Graf::findPath()':
main.cpp:46:82: error: expected ')' before ';' token
46 | d[j][0][stare | (1<<j)] = min(d[j][0][stare | (1<<j)];
| ^
main.cpp:46:58: note: to match this '('
46 | d[j][0][stare | (1<<j)] = min(d[j][0][stare | (1<<j)];
| ^
main.cpp:47:76: error: expected ')' before ';' token
47 | min(d[i][0][stare] + dist(seg[i][1], seg[j][0]);
| ^
main.cpp:47:32: note: to match this '('
47 | min(d[i][0][stare] + dist(seg[i][1], seg[j][0]);
| ^
main.cpp:48:72: error: expected ';' before ')' token
48 | d[i][1][stare] + dist(seg[i][0], seg[j][0])));
| ^
main.cpp:48:44: warning: value computed is not used [-Wunused-value]
48 | d[i][1][stare] + dist(seg[i][0], seg[j][0])));
main.cpp:49:82: error: expected ')' before ';' token
49 | d[j][1][stare | (1<<j)] = min(d[j][1][stare | (1<<j)];
| ^
main.cpp:49:58: note: to match this '('
49 | d[j][1][stare | (1<<j)] = min(d[j][1][stare | (1<<j)];
| ^
main.cpp:50:76: error: expected ')' before ';' token
50 | min(d[i][0][stare] + dist(seg[i][1], seg[j][1]);
| ^
main.cpp:50:32: note: to match this '('
50 | min(d[i][0][stare] + dist(seg[i][1], seg[j][1]);
| ^
main.cpp:51:72: error: expected ';' before ')' token
51 | d[i][1][stare] + dist(seg[i][0], seg[j][1])));
| ^
main.cpp:51:44: warning: value computed is not used [-Wunused-value]
51 | d[i][1][stare] + dist(seg[i][0], seg[j][1])));
Non zero exit status: 1
Ceva nu functioneaza?
- Citeste despre borderoul de evaluare.
- Daca tot nu e bine, contacteaza-ne pe forum !