Borderou de evaluare (job #1738692)
Utilizator | Data | 7 august 2016 14:54:04 | |
---|---|---|---|
Problema | SuperP | 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:105:22: warning: format ‘%d’ expects argument of type ‘int*’, but argument 2 has type ‘long long int*’ [-Wformat=]
scanf("%d",&x);
^
user.cpp:120:39: warning: format ‘%d’ expects argument of type ‘int’, but argument 2 has type ‘long long int’ [-Wformat=]
printf("%d\n",it.first);
^
In file included from /usr/include/c++/4.8/bits/stl_algobase.h:64:0,
from /usr/include/c++/4.8/bits/char_traits.h:39,
from /usr/include/c++/4.8/string:40,
from /usr/include/c++/4.8/bitset:47,
from user.cpp:2:
/usr/include/c++/4.8/bits/stl_pair.h: In instantiation of ‘constexpr bool std::operator<(const std::pair<_T1, _T2>&, const std::pair<_T1, _T2>&) [with _T1 = long long int; _T2 = std::unordered_map<int, int>]’:
/usr/include/c++/4.8/bits/stl_algo.h:2161:13: required from ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<long long int, std::unordered_map<int, int> >*, std::vector<std::pair<long long int, std::unordered_map<int, int> > > >]’
/usr/include/c++/4.8/bits/stl_algo.h:2235:62: required from ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<long long int, std::unordered_map<int, int> >*, std::vector<std::pair<long long int, std::unordered_map<int, int> > > >]’
/usr/include/c++/4.8/bits/stl_algo.h:5476:47: required from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<std::pair<long long int, std::unordered_map<int, int> >*, std::vector<std::pair<long long int, std::unordered_map<int, int> > > >]’
user.cpp:101:28: required from here
/usr/include/c++/4.8/bits/stl_pair.h:222:50: error: no match for ‘operator<’ (operand types are ‘const std::unordered_map<int, int>’ and ‘const std::unordered_map<int, int>’)
|| (!(__y.first < __x.first) && __x.second < __y.second); }
^
/usr/include/c++/4.8/bits/stl_pair.h:222:50: note: candidates are:
/usr/include/c++/4.8/bits/stl_pair.h:220:5: note: template<class _T1, class _T2> constexpr bool std::operator<(const std::pair<_T1, _T2>&, const std::pair<_T1, _T2>&)
operator<(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
^
/usr/include/c++/4.8/bits/stl_pair.h:220:5: note: template argument deduction/substitution failed:
/usr/include/c++/4.8/bits/stl_pair.h:222:50: note: ‘const std::unordered_map<int, int>’ is not derived from ‘const std::pair<_T1, _T2>’
|| (!(__y.first < __x.first) && __x.second < __y.second); }
^
In file included from /usr/include/c++/4.8/bits/stl_algobase.h:67:0,
from /usr/include/c++/4.8/bits/char_traits.h:39,
from /usr/include/c++/4.8/string:40,
from /usr/include/c++/4.8/bitset:47,
from user.cpp:2:
/usr/include/c++/4.8/bits/stl_iterator.h:297:5: note: template<class _Iterator> bool std::operator<(const std::reverse_iterator<_Iterator>&, const std::reverse_iterator<_Iterator>&)
operator<(const reverse_iterator<_Iterator>& __x,
^
/usr/include/c++/4.8/bits/stl_iterator.h:297:5: note: template argument deduction/substitution failed:
In file included from /usr/include/c++/4.8/bits/stl_algobase.h:64:0,
from /usr/include/c++/4.8/bits/char_traits.h:39,
from /usr/include/c++/4.8/string:40,
from /usr/include/c++/4.8/bitset:47,
from user.cpp:2:
/usr/include/c++/4.8/bits/stl_pair.h:222:50: note: ‘const std::unordered_map<int, int>’ is not derived from ‘const std::reverse_iterator<_Iterator>’
|| (!(__y.first < __x.first) && __x.second < __y.second); }
^
In file included from /usr/include/c++/4.8/bits/stl_algobase.h:67:0,
from /usr/include/c++/4.8/bits/char_traits.h:39,
from /usr/include/c++/4.8/string:40,
from /usr/include/c++/4.8/bitset:47,
from user.cpp:2:
Ceva nu functioneaza?
- Citeste despre borderoul de evaluare.
- Daca tot nu e bine, contacteaza-ne pe forum !