Borderou de evaluare (job #2702846)
Utilizator | Data | 6 februarie 2021 01:29:11 | |
---|---|---|---|
Problema | Cc | Status | done |
Runda | Arhiva de probleme | Compilator | cpp-64 | Vezi sursa |
Scor | 0 |
Raport evaluator
Eroare de compilare:
main.cpp: In function 'void bellman()':
main.cpp:30:5: error: reference to 'prev' is ambiguous
prev[*it]=x;
^~~~
main.cpp:13:26: note: candidates are: int prev [205]
int inq[Nmax],Dist[Nmax],prev[Nmax];
^~~~
In file included from /usr/include/c++/6/bits/stl_algobase.h:66:0,
from /usr/include/c++/6/vector:60,
from main.cpp:2:
/usr/include/c++/6/bits/stl_iterator_base_funcs.h:217:5: note: template<class _BidirectionalIterator> _BidirectionalIterator std::prev(_BidirectionalIterator, typename std::iterator_traits<_Iter>::difference_type)
prev(_BidirectionalIterator __x, typename
^~~~
main.cpp:38:27: error: reference to 'prev' is ambiguous
for(i=2*n+1; i!=2*n+2; i=prev[i])
^~~~
main.cpp:13:26: note: candidates are: int prev [205]
int inq[Nmax],Dist[Nmax],prev[Nmax];
^~~~
In file included from /usr/include/c++/6/bits/stl_algobase.h:66:0,
from /usr/include/c++/6/vector:60,
from main.cpp:2:
/usr/include/c++/6/bits/stl_iterator_base_funcs.h:217:5: note: template<class _BidirectionalIterator> _BidirectionalIterator std::prev(_BidirectionalIterator, typename std::iterator_traits<_Iter>::difference_type)
prev(_BidirectionalIterator __x, typename
^~~~
main.cpp:39:5: error: reference to 'prev' is ambiguous
F[prev[i]][i]++, F[i][prev[i]]--;
^~~~
main.cpp:13:26: note: candidates are: int prev [205]
int inq[Nmax],Dist[Nmax],prev[Nmax];
^~~~
In file included from /usr/include/c++/6/bits/stl_algobase.h:66:0,
from /usr/include/c++/6/vector:60,
from main.cpp:2:
/usr/include/c++/6/bits/stl_iterator_base_funcs.h:217:5: note: template<class _BidirectionalIterator> _BidirectionalIterator std::prev(_BidirectionalIterator, typename std::iterator_traits<_Iter>::difference_type)
prev(_BidirectionalIterator __x, typename
^~~~
main.cpp:39:25: error: reference to 'prev' is ambiguous
F[prev[i]][i]++, F[i][prev[i]]--;
^~~~
main.cpp:13:26: note: candidates are: int prev [205]
int inq[Nmax],Dist[Nmax],prev[Nmax];
^~~~
In file included from /usr/include/c++/6/bits/stl_algobase.h:66:0,
from /usr/include/c++/6/vector:60,
from main.cpp:2:
/usr/include/c++/6/bits/stl_iterator_base_funcs.h:217:5: note: template<class _BidirectionalIterator> _BidirectionalIterator std::prev(_BidirectionalIterator, typename std::iterator_traits<_Iter>::difference_type)
prev(_BidirectionalIterator __x, typename
^~~~
main.cpp: In function 'int main()':
Non zero exit status: 1
Ceva nu functioneaza?
- Citeste despre borderoul de evaluare.
- Daca tot nu e bine, contacteaza-ne pe forum !