Borderou de evaluare (job #1005568)
| Utilizator |  Aiordachioaei Marius Flameingo |
Data | 5 octombrie 2013 11:54:45 |
|---|---|---|---|
| Problema | Flux maxim | Status | done |
| Runda | Arhiva educationala | Compilator | cpp | Vezi sursa |
| Scor | 0 | ||
Raport evaluator
Eroare de compilare:
user.cpp: In function ‘bool BFS()’:
user.cpp:29:17: error: reference to ‘prev’ is ambiguous
prev[*i] = node,
^
user.cpp:13:39: note: candidates are: int prev [1003]
int cap[NMAX][NMAX], res[NMAX][NMAX], prev[NMAX], N;
^
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:2:
/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: In function ‘int main()’:
user.cpp:53:13: error: reference to ‘prev’ is ambiguous
prev[N] = *j;
^
user.cpp:13:39: note: candidates are: int prev [1003]
int cap[NMAX][NMAX], res[NMAX][NMAX], prev[NMAX], N;
^
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:2:
/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:46: error: reference to ‘prev’ is ambiguous
for (node = N; node != 1; node = prev[node])
^
user.cpp:13:39: note: candidates are: int prev [1003]
int cap[NMAX][NMAX], res[NMAX][NMAX], prev[NMAX], N;
^
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:2:
/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:39: error: reference to ‘prev’ is ambiguous
_min = min (_min, cap[prev[node]][node] - res[prev[node]][node]);
^
user.cpp:13:39: note: candidates are: int prev [1003]
int cap[NMAX][NMAX], res[NMAX][NMAX], prev[NMAX], N;
^
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:2:
/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
^
Ceva nu functioneaza?
- Citeste despre borderoul de evaluare.
- Daca tot nu e bine, contacteaza-ne pe forum !
