Borderou de evaluare (job #2043889)

Utilizator Stefan_RaduStefan Radu Stefan_Radu Data 20 octombrie 2017 18:39:48
Problema Heavy Path Decomposition Status done
Runda Arhiva educationala Compilator cpp | Vezi sursa
Scor 0

Raport evaluator

Eroare de compilare: user.cpp: In function ‘void Make_chains(int, int)’: user.cpp:159:39: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for (int j = 1; j < chain[i].size(); j ++) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from user.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h: In instantiation of ‘_RandomAccessIterator std::__unguarded_partition(_RandomAccessIterator, _RandomAccessIterator, const _Tp&, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<int*, std::vector<int> >; _Tp = int; _Compare = Make_chains(int, int)::__lambda0]’: /usr/include/c++/4.8/bits/stl_algo.h:2319:78: required from ‘_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<int*, std::vector<int> >; _Compare = Make_chains(int, int)::__lambda0]’ /usr/include/c++/4.8/bits/stl_algo.h:2360:62: required from ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<int*, std::vector<int> >; _Size = int; _Compare = Make_chains(int, int)::__lambda0]’ /usr/include/c++/4.8/bits/stl_algo.h:5513:44: required from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<int*, std::vector<int> >; _Compare = Make_chains(int, int)::__lambda0]’ user.cpp:157:6: required from here /usr/include/c++/4.8/bits/stl_algo.h:2287:35: error: no match for call to ‘(Make_chains(int, int)::__lambda0) (int&, const int&)’ while (__comp(*__first, __pivot)) ^ user.cpp:155:49: note: candidates are: sort(chain[i].begin() + 1, chain[i].end(), [] (int &a, int &b) -> bool { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from user.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:2287:35: note: bool (*)(int&, int&) <conversion> while (__comp(*__first, __pivot)) ^ /usr/include/c++/4.8/bits/stl_algo.h:2287:35: note: candidate expects 3 arguments, 3 provided user.cpp:155:71: note: Make_chains(int, int)::__lambda0 sort(chain[i].begin() + 1, chain[i].end(), [] (int &a, int &b) -> bool { ^ user.cpp:155:71: note: no known conversion for argument 2 from ‘const int’ to ‘int&’ In file included from /usr/include/c++/4.8/algorithm:62:0, from user.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:2290:34: error: no match for call to ‘(Make_chains(int, int)::__lambda0) (const int&, int&)’ while (__comp(__pivot, *__last)) ^ user.cpp:155:49: note: candidates are: sort(chain[i].begin() + 1, chain[i].end(), [] (int &a, int &b) -> bool { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from user.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:2290:34: note: bool (*)(int&, int&) <conversion> while (__comp(__pivot, *__last)) ^ /usr/include/c++/4.8/bits/stl_algo.h:2290:34: note: candidate expects 3 arguments, 3 provided user.cpp:155:71: note: Make_chains(int, int)::__lambda0 sort(chain[i].begin() + 1, chain[i].end(), [] (int &a, int &b) -> bool { ^ user.cpp:155:71: note: no known conversion for argument 1 from ‘const int’ to ‘int&’

Ceva nu functioneaza?