Borderou de evaluare (job #1985194)
Utilizator | Data | 27 mai 2017 02:40:09 | |
---|---|---|---|
Problema | Luff | Status | done |
Runda | Arhiva de probleme | Compilator | cpp | Vezi sursa |
Scor | 0 |
Raport evaluator
Eroare de compilare:
In file included from /usr/include/c++/4.8/algorithm:62:0,
from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64,
from user.cpp:1:
/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<std::tuple<int, int, int>*, std::vector<std::tuple<int, int, int> > >; _Tp = std::tuple<int, int, int>; _Compare = std::greater<std::tuple<int, int, int>&>]’:
/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<std::tuple<int, int, int>*, std::vector<std::tuple<int, int, int> > >; _Compare = std::greater<std::tuple<int, int, int>&>]’
/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<std::tuple<int, int, int>*, std::vector<std::tuple<int, int, int> > >; _Size = int; _Compare = std::greater<std::tuple<int, int, int>&>]’
/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<std::tuple<int, int, int>*, std::vector<std::tuple<int, int, int> > >; _Compare = std::greater<std::tuple<int, int, int>&>]’
user.cpp:40:59: required from here
/usr/include/c++/4.8/bits/stl_algo.h:2287:35: error: no match for call to ‘(std::greater<std::tuple<int, int, int>&>) (std::tuple<int, int, int>&, const std::tuple<int, int, int>&)’
while (__comp(*__first, __pivot))
^
In file included from /usr/include/c++/4.8/string:48:0,
from /usr/include/c++/4.8/bits/locale_classes.h:40,
from /usr/include/c++/4.8/bits/ios_base.h:41,
from /usr/include/c++/4.8/ios:42,
from /usr/include/c++/4.8/istream:38,
from /usr/include/c++/4.8/sstream:38,
from /usr/include/c++/4.8/complex:45,
from /usr/include/c++/4.8/ccomplex:38,
from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:52,
from user.cpp:1:
/usr/include/c++/4.8/bits/stl_function.h:222:12: note: candidate is:
struct greater : public binary_function<_Tp, _Tp, bool>
^
/usr/include/c++/4.8/bits/stl_function.h:225:7: note: bool std::greater<_Tp>::operator()(const _Tp&, const _Tp&) const [with _Tp = std::tuple<int, int, int>&]
operator()(const _Tp& __x, const _Tp& __y) const
^
/usr/include/c++/4.8/bits/stl_function.h:225:7: note: no known conversion for argument 2 from ‘const std::tuple<int, int, int>’ to ‘std::tuple<int, int, int>&’
In file included from /usr/include/c++/4.8/algorithm:62:0,
from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64,
from user.cpp:1:
/usr/include/c++/4.8/bits/stl_algo.h:2290:34: error: no match for call to ‘(std::greater<std::tuple<int, int, int>&>) (const std::tuple<int, int, int>&, std::tuple<int, int, int>&)’
while (__comp(__pivot, *__last))
^
In file included from /usr/include/c++/4.8/string:48:0,
from /usr/include/c++/4.8/bits/locale_classes.h:40,
from /usr/include/c++/4.8/bits/ios_base.h:41,
from /usr/include/c++/4.8/ios:42,
from /usr/include/c++/4.8/istream:38,
from /usr/include/c++/4.8/sstream:38,
from /usr/include/c++/4.8/complex:45,
from /usr/include/c++/4.8/ccomplex:38,
from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:52,
from user.cpp:1:
/usr/include/c++/4.8/bits/stl_function.h:222:12: note: candidate is:
struct greater : public binary_function<_Tp, _Tp, bool>
^
/usr/include/c++/4.8/bits/stl_function.h:225:7: note: bool std::greater<_Tp>::operator()(const _Tp&, const _Tp&) const [with _Tp = std::tuple<int, int, int>&]
operator()(const _Tp& __x, const _Tp& __y) const
^
Ceva nu functioneaza?
- Citeste despre borderoul de evaluare.
- Daca tot nu e bine, contacteaza-ne pe forum !