Borderou de evaluare (job #1583853)
Utilizator | Data | 29 ianuarie 2016 14:18:27 | |
---|---|---|---|
Problema | Mst | Status | done |
Runda | Arhiva de probleme | Compilator | cpp | Vezi sursa |
Scor | 0 |
Raport evaluator
Eroare de compilare:
user.cpp: In function ‘int main()’:
user.cpp:119:44: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i = 0, j = 1; j < good_times.size(); ++i, ++j){
^
In file included from /usr/include/c++/4.8/algorithm:62:0,
from user.cpp:7:
/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<muchie*, std::vector<muchie> >; _Tp = muchie; _Compare = find_best_in_interval(int, std::vector<muchie>&, double, double)::__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<muchie*, std::vector<muchie> >; _Compare = find_best_in_interval(int, std::vector<muchie>&, double, double)::__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<muchie*, std::vector<muchie> >; _Size = int; _Compare = find_best_in_interval(int, std::vector<muchie>&, double, double)::__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<muchie*, std::vector<muchie> >; _Compare = find_best_in_interval(int, std::vector<muchie>&, double, double)::__lambda0]’
user.cpp:87:49: required from here
/usr/include/c++/4.8/bits/stl_algo.h:2287:35: error: no match for call to ‘(find_best_in_interval(int, std::vector<muchie>&, double, double)::__lambda0) (muchie&, const muchie&)’
while (__comp(*__first, __pivot))
^
user.cpp:86:42: note: candidate is:
sort(begin(graf), end(graf), [&sort_vals](const muchie& a, muchie& b){
^
user.cpp:86:70: note: find_best_in_interval(int, std::vector<muchie>&, double, double)::__lambda0
sort(begin(graf), end(graf), [&sort_vals](const muchie& a, muchie& b){
^
user.cpp:86:70: note: no known conversion for argument 2 from ‘const muchie’ to ‘muchie&’
Ceva nu functioneaza?
- Citeste despre borderoul de evaluare.
- Daca tot nu e bine, contacteaza-ne pe forum !