Borderou de evaluare (job #1040032)
Utilizator | Data | 23 noiembrie 2013 21:22:53 | |
---|---|---|---|
Problema | Inter | Status | done |
Runda | Arhiva de probleme | Compilator | cpp | Vezi sursa |
Scor | 0 |
Raport evaluator
Eroare de compilare:
user.cpp: In function ‘void read(FILE*, int&, int&)’:
user.cpp:14:31: error: reference to ‘move’ is ambiguous
fscanf( fin, "%d%d", &move[i].first, &move[i].second );
^
user.cpp:8:18: note: candidates are: std::pair<int, int> move [1000]
pair< int, int > move[MAX_N];
^
In file included from /usr/local/include/c++/4.8.0/algorithm:61:0,
from user.cpp:2:
/usr/local/include/c++/4.8.0/bits/stl_algobase.h:483:5: note: template<class _II, class _OI> _OI std::move(_II, _II, _OI)
move(_II __first, _II __last, _OI __result)
^
In file included from /usr/local/include/c++/4.8.0/bits/stl_pair.h:59:0,
from /usr/local/include/c++/4.8.0/utility:70,
from /usr/local/include/c++/4.8.0/algorithm:60,
from user.cpp:2:
/usr/local/include/c++/4.8.0/bits/move.h:101:5: note: template<class _Tp> constexpr typename std::remove_reference< <template-parameter-1-1> >::type&& std::move(_Tp&&)
move(_Tp&& __t) noexcept
^
user.cpp:14:47: error: reference to ‘move’ is ambiguous
fscanf( fin, "%d%d", &move[i].first, &move[i].second );
^
user.cpp:8:18: note: candidates are: std::pair<int, int> move [1000]
pair< int, int > move[MAX_N];
^
In file included from /usr/local/include/c++/4.8.0/algorithm:61:0,
from user.cpp:2:
/usr/local/include/c++/4.8.0/bits/stl_algobase.h:483:5: note: template<class _II, class _OI> _OI std::move(_II, _II, _OI)
move(_II __first, _II __last, _OI __result)
^
In file included from /usr/local/include/c++/4.8.0/bits/stl_pair.h:59:0,
from /usr/local/include/c++/4.8.0/utility:70,
from /usr/local/include/c++/4.8.0/algorithm:60,
from user.cpp:2:
/usr/local/include/c++/4.8.0/bits/move.h:101:5: note: template<class _Tp> constexpr typename std::remove_reference< <template-parameter-1-1> >::type&& std::move(_Tp&&)
move(_Tp&& __t) noexcept
^
user.cpp:15:14: error: reference to ‘move’ is ambiguous
if ( move[i].first > move[i].second )
^
user.cpp:8:18: note: candidates are: std::pair<int, int> move [1000]
pair< int, int > move[MAX_N];
^
In file included from /usr/local/include/c++/4.8.0/algorithm:61:0,
from user.cpp:2:
/usr/local/include/c++/4.8.0/bits/stl_algobase.h:483:5: note: template<class _II, class _OI> _OI std::move(_II, _II, _OI)
move(_II __first, _II __last, _OI __result)
^
In file included from /usr/local/include/c++/4.8.0/bits/stl_pair.h:59:0,
from /usr/local/include/c++/4.8.0/utility:70,
Ceva nu functioneaza?
- Citeste despre borderoul de evaluare.
- Daca tot nu e bine, contacteaza-ne pe forum !