Borderou de evaluare (job #986107)
Utilizator | Data | 17 august 2013 18:17:51 | |
---|---|---|---|
Problema | Traseu | Status | done |
Runda | Arhiva de probleme | Compilator | cpp | Vezi sursa |
Scor | 0 |
Raport evaluator
Eroare de compilare:
user.cpp: In function ‘int drum()’:
user.cpp:34:9: error: reference to ‘prev’ is ambiguous
prev[i] = -1;
^
user.cpp:23:13: note: candidates are: int prev [65]
int d[nmax],prev[nmax];
^
In file included from /usr/local/include/c++/4.8.0/bits/stl_algobase.h:66:0,
from /usr/local/include/c++/4.8.0/vector:60,
from user.cpp:11:
/usr/local/include/c++/4.8.0/bits/stl_iterator_base_funcs.h:193:5: note: template<class _BidirectionalIterator> _BidirectionalIterator std::prev(_BidirectionalIterator, typename std::iterator_traits<_Iter>::difference_type)
prev(_BidirectionalIterator __x, typename
^
user.cpp:45:25: error: reference to ‘prev’ is ambiguous
prev[k] = j;
^
user.cpp:23:13: note: candidates are: int prev [65]
int d[nmax],prev[nmax];
^
In file included from /usr/local/include/c++/4.8.0/bits/stl_algobase.h:66:0,
from /usr/local/include/c++/4.8.0/vector:60,
from user.cpp:11:
/usr/local/include/c++/4.8.0/bits/stl_iterator_base_funcs.h:193:5: note: template<class _BidirectionalIterator> _BidirectionalIterator std::prev(_BidirectionalIterator, typename std::iterator_traits<_Iter>::difference_type)
prev(_BidirectionalIterator __x, typename
^
user.cpp:54:35: error: reference to ‘prev’ is ambiguous
minim = min(minim,cap[prev[x]][x] - fl[prev[x]][x]);
^
user.cpp:23:13: note: candidates are: int prev [65]
int d[nmax],prev[nmax];
^
In file included from /usr/local/include/c++/4.8.0/bits/stl_algobase.h:66:0,
from /usr/local/include/c++/4.8.0/vector:60,
from user.cpp:11:
/usr/local/include/c++/4.8.0/bits/stl_iterator_base_funcs.h:193:5: note: template<class _BidirectionalIterator> _BidirectionalIterator std::prev(_BidirectionalIterator, typename std::iterator_traits<_Iter>::difference_type)
prev(_BidirectionalIterator __x, typename
^
user.cpp:54:52: error: reference to ‘prev’ is ambiguous
minim = min(minim,cap[prev[x]][x] - fl[prev[x]][x]);
^
user.cpp:23:13: note: candidates are: int prev [65]
int d[nmax],prev[nmax];
^
In file included from /usr/local/include/c++/4.8.0/bits/stl_algobase.h:66:0,
from /usr/local/include/c++/4.8.0/vector:60,
from user.cpp:11:
/usr/local/include/c++/4.8.0/bits/stl_iterator_base_funcs.h:193:5: note: template<class _BidirectionalIterator> _BidirectionalIterator std::prev(_BidirectionalIterator, typename std::iterator_traits<_Iter>::difference_type)
prev(_BidirectionalIterator __x, typename
^
user.cpp:55:17: error: reference to ‘prev’ is ambiguous
Ceva nu functioneaza?
- Citeste despre borderoul de evaluare.
- Daca tot nu e bine, contacteaza-ne pe forum !