Borderou de evaluare (job #1885647)
Utilizator | Data | 20 februarie 2017 10:40:14 | |
---|---|---|---|
Problema | Traseu | Status | done |
Runda | becreative19 | Compilator | cpp | Vezi sursa |
Scor | 0 |
Raport evaluator
Eroare de compilare:
user.cpp: In function ‘int bf()’:
user.cpp:13:31: error: reference to ‘prev’ is ambiguous
d[i]=d[nod]+cost[nod][i];prev[i]=nod;
^
user.cpp:4:61: note: candidates are: int prev [64]
int mat[64][64],in[64],out[64],n,m,cap[64][64],cost[64][64],prev[64],sol;
^
In file included from /usr/include/c++/4.8/bits/stl_algobase.h:66:0,
from /usr/include/c++/4.8/bits/char_traits.h:39,
from /usr/include/c++/4.8/ios:40,
from /usr/include/c++/4.8/istream:38,
from /usr/include/c++/4.8/fstream:38,
from user.cpp:1:
/usr/include/c++/4.8/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:37:16: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
while(temp=bf()){
^
user.cpp:39:23: error: reference to ‘prev’ is ambiguous
for(nod=n+1;nod;nod=prev[nod]){if(cap[prev[nod]][nod]<min_cap){min_cap=cap[prev[nod]][nod];}}
^
user.cpp:4:61: note: candidates are: int prev [64]
int mat[64][64],in[64],out[64],n,m,cap[64][64],cost[64][64],prev[64],sol;
^
In file included from /usr/include/c++/4.8/bits/stl_algobase.h:66:0,
from /usr/include/c++/4.8/bits/char_traits.h:39,
from /usr/include/c++/4.8/ios:40,
from /usr/include/c++/4.8/istream:38,
from /usr/include/c++/4.8/fstream:38,
from user.cpp:1:
/usr/include/c++/4.8/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:39:41: error: reference to ‘prev’ is ambiguous
for(nod=n+1;nod;nod=prev[nod]){if(cap[prev[nod]][nod]<min_cap){min_cap=cap[prev[nod]][nod];}}
^
user.cpp:4:61: note: candidates are: int prev [64]
int mat[64][64],in[64],out[64],n,m,cap[64][64],cost[64][64],prev[64],sol;
^
In file included from /usr/include/c++/4.8/bits/stl_algobase.h:66:0,
from /usr/include/c++/4.8/bits/char_traits.h:39,
from /usr/include/c++/4.8/ios:40,
from /usr/include/c++/4.8/istream:38,
from /usr/include/c++/4.8/fstream:38,
from user.cpp:1:
/usr/include/c++/4.8/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 !