Borderou de evaluare (job #1119470)

Utilizator alexalghisiAlghisi Alessandro Paolo alexalghisi Data 24 februarie 2014 18:01:03
Problema Flux maxim de cost minim Status done
Runda Arhiva educationala Compilator cpp | Vezi sursa
Scor 0

Raport evaluator

Eroare de compilare: user.cpp: In function ‘int bf()’: user.cpp:37:9: error: reference to ‘prev’ is ambiguous prev[i]=-1; ^ user.cpp:26:57: note: candidates are: int prev [369] int n,m,s,d,dist[DN],C[DN][DN],cost[DN][DN],exista_drum,prev[DN],F[DN][DN]; ^ 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/bits/char_traits.h:39, from /usr/local/include/c++/4.8.0/ios:40, from /usr/local/include/c++/4.8.0/ostream:38, from /usr/local/include/c++/4.8.0/iostream:39, from user.cpp:1: /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:49:40: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int i=0;i<list[ nod ].size(); ++i ){ ^ user.cpp:56:17: error: reference to ‘prev’ is ambiguous prev[ next_nod ] = nod; ^ user.cpp:26:57: note: candidates are: int prev [369] int n,m,s,d,dist[DN],C[DN][DN],cost[DN][DN],exista_drum,prev[DN],F[DN][DN]; ^ 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/bits/char_traits.h:39, from /usr/local/include/c++/4.8.0/ios:40, from /usr/local/include/c++/4.8.0/ostream:38, from /usr/local/include/c++/4.8.0/iostream:39, from user.cpp:1: /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:72:41: error: reference to ‘prev’ is ambiguous for(int nod = d; nod!=s ; nod = prev[nod] ) ^ user.cpp:26:57: note: candidates are: int prev [369] int n,m,s,d,dist[DN],C[DN][DN],cost[DN][DN],exista_drum,prev[DN],F[DN][DN]; ^ 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/bits/char_traits.h:39, from /usr/local/include/c++/4.8.0/ios:40, from /usr/local/include/c++/4.8.0/ostream:38, from /usr/local/include/c++/4.8.0/iostream:39, from user.cpp:1: /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:73:31: error: reference to ‘prev’ is ambiguous

Ceva nu functioneaza?