Borderou de evaluare (job #2680232)
Utilizator | Data | 2 decembrie 2020 23:38:17 | |
---|---|---|---|
Problema | Vis | Status | done |
Runda | Arhiva de probleme | Compilator | cpp-64 | Vezi sursa |
Scor | 0 |
Raport evaluator
Eroare de compilare:
main.cpp: In function 'int main(int, const char**)':
main.cpp:89:130: error: no matching function for call to 'min(<brace-enclosed initializer list>)'
out << std::min({L_1_1_L_n_n, L_1_1_L_l1_c1_L_n_n, L_1_1_L_l2_c2_L_n_n, L_1_1_L_l1_c1_L_l2_c2_L_n_n,L_1_1_L_l2_c2_L_l1_c1_L_n_n}) + 1 ;
^
In file included from /usr/include/c++/6/bits/char_traits.h:39:0,
from /usr/include/c++/6/ios:40,
from /usr/include/c++/6/ostream:38,
from /usr/include/c++/6/iostream:39,
from main.cpp:8:
/usr/include/c++/6/bits/stl_algobase.h:195:5: note: candidate: template<class _Tp> constexpr const _Tp& std::min(const _Tp&, const _Tp&)
min(const _Tp& __a, const _Tp& __b)
^~~
/usr/include/c++/6/bits/stl_algobase.h:195:5: note: template argument deduction/substitution failed:
main.cpp:89:130: note: candidate expects 2 arguments, 1 provided
out << std::min({L_1_1_L_n_n, L_1_1_L_l1_c1_L_n_n, L_1_1_L_l2_c2_L_n_n, L_1_1_L_l1_c1_L_l2_c2_L_n_n,L_1_1_L_l2_c2_L_l1_c1_L_n_n}) + 1 ;
^
In file included from /usr/include/c++/6/bits/char_traits.h:39:0,
from /usr/include/c++/6/ios:40,
from /usr/include/c++/6/ostream:38,
from /usr/include/c++/6/iostream:39,
from main.cpp:8:
/usr/include/c++/6/bits/stl_algobase.h:243:5: note: candidate: template<class _Tp, class _Compare> constexpr const _Tp& std::min(const _Tp&, const _Tp&, _Compare)
min(const _Tp& __a, const _Tp& __b, _Compare __comp)
^~~
/usr/include/c++/6/bits/stl_algobase.h:243:5: note: template argument deduction/substitution failed:
main.cpp:89:130: note: candidate expects 3 arguments, 1 provided
out << std::min({L_1_1_L_n_n, L_1_1_L_l1_c1_L_n_n, L_1_1_L_l2_c2_L_n_n, L_1_1_L_l1_c1_L_l2_c2_L_n_n,L_1_1_L_l2_c2_L_l1_c1_L_n_n}) + 1 ;
^
Non zero exit status: 1
Ceva nu functioneaza?
- Citeste despre borderoul de evaluare.
- Daca tot nu e bine, contacteaza-ne pe forum !