Borderou de evaluare (job #1384373)
Utilizator | Data | 11 martie 2015 06:34:42 | |
---|---|---|---|
Problema | Johnie | Status | done |
Runda | Arhiva de probleme | Compilator | cpp | Vezi sursa |
Scor | 0 |
Raport evaluator
Eroare de compilare:
user.cpp: In function ‘void find_euler_cycle(int)’:
user.cpp:40:80: error: no matching function for call to ‘find(std::vector<int>::iterator, std::vector<int>::iterator, int&)’
list[new_node].erase(find(list[new_node].begin(), list[new_node].end(), node)),
^
user.cpp:40:80: note: candidate is:
In file included from /usr/include/c++/4.8/bits/locale_facets.h:48:0,
from /usr/include/c++/4.8/bits/basic_ios.h:37,
from /usr/include/c++/4.8/ios:44,
from /usr/include/c++/4.8/istream:38,
from /usr/include/c++/4.8/fstream:38,
from user.cpp:1:
/usr/include/c++/4.8/bits/streambuf_iterator.h:369:5: note: template<class _CharT2> typename __gnu_cxx::__enable_if<std::__is_char<_CharT2>::__value, std::istreambuf_iterator<_CharT> >::__type std::find(std::istreambuf_iterator<_CharT>, std::istreambuf_iterator<_CharT>, const _CharT2&)
find(istreambuf_iterator<_CharT> __first,
^
/usr/include/c++/4.8/bits/streambuf_iterator.h:369:5: note: template argument deduction/substitution failed:
user.cpp:40:80: note: ‘__gnu_cxx::__normal_iterator<int*, std::vector<int> >’ is not derived from ‘std::istreambuf_iterator<_CharT>’
list[new_node].erase(find(list[new_node].begin(), list[new_node].end(), node)),
^
user.cpp:42:131: error: second operand to the conditional operator is of type ‘void’, but the third operand is neither a throw-expression nor of type ‘void’
else !node && cycle[cycle[0][0]].size() > 0 && st.size() > 1 ? broke[cycle[0][0]].push_back(cycle[cycle[0][0]].size()) : node = node,
^
user.cpp: In function ‘int main()’:
user.cpp:64:55: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i = 0, left = 0, right; i <= broke[k].size(); i++){
^
user.cpp:65:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
right = i < broke[k].size() ? broke[k][i] - 1 : cycle[k].size();
^
Ceva nu functioneaza?
- Citeste despre borderoul de evaluare.
- Daca tot nu e bine, contacteaza-ne pe forum !