Borderou de evaluare (job #1468086)

Utilizator vladttturcuman vlad vladtt Data 5 august 2015 11:06:23
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:38:32: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(i=0; i<g[nod].size(); i++) ^ user.cpp: In function ‘int main()’: user.cpp:70:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int i=0; i<g[n].size(); i++) ^ user.cpp:77:17: error: reference to ‘prev’ is ambiguous prev=g[n][i]; ^ user.cpp:19:41: note: candidates are: int prev int in,s,sf,nod,cost,i,n,m,j,x,y,c,last,prev; ^ 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:80:40: error: reference to ‘prev’ is ambiguous cost = cost < maxx[prev][last]-cons[prev][last] ? cost : maxx[prev][last]-cons[prev][last]; ^ user.cpp:19:41: note: candidates are: int prev int in,s,sf,nod,cost,i,n,m,j,x,y,c,last,prev; ^ 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:80:57: error: reference to ‘prev’ is ambiguous cost = cost < maxx[prev][last]-cons[prev][last] ? cost : maxx[prev][last]-cons[prev][last]; ^ user.cpp:19:41: note: candidates are: int prev int in,s,sf,nod,cost,i,n,m,j,x,y,c,last,prev; ^ 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:

Ceva nu functioneaza?