Borderou de evaluare (job #1737105)

Utilizator Bulgaru_Robert_Razvan_323CBBulgaru Robert Razvan Bulgaru_Robert_Razvan_323CB Data 3 august 2016 13:10:12
Problema BFS - Parcurgere in latime Status done
Runda Arhiva educationala Compilator cpp | Vezi sursa
Scor 0

Raport evaluator

Eroare de compilare: user.cpp: In function ‘void BFS(int)’: user.cpp:24:2: error: reference to ‘distance’ is ambiguous distance[source]=0; ^ user.cpp:17:5: note: candidates are: int distance [100000] int distance[N]; ^ 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:114:5: note: template<class _InputIterator> typename std::iterator_traits<_Iterator>::difference_type std::distance(_InputIterator, _InputIterator) distance(_InputIterator __first, _InputIterator __last) ^ user.cpp:29:46: error: ‘j’ was not declared in this scope for (unsigned int i=0;i<graph[node].size();j++) { ^ user.cpp:30:8: error: reference to ‘distance’ is ambiguous if (distance[[graph[node]][i]]==-1) { ^ user.cpp:17:5: note: candidates are: int distance [100000] int distance[N]; ^ 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:114:5: note: template<class _InputIterator> typename std::iterator_traits<_Iterator>::difference_type std::distance(_InputIterator, _InputIterator) distance(_InputIterator __first, _InputIterator __last) ^ user.cpp:30:16: error: two consecutive ‘[’ shall only introduce an attribute before ‘[’ token if (distance[[graph[node]][i]]==-1) { ^ user.cpp:30:16: error: expected ‘)’ before ‘[’ token user.cpp:31:5: error: reference to ‘distance’ is ambiguous distance[graph[node][i]]=distance[node]+1; ^ user.cpp:17:5: note: candidates are: int distance [100000] int distance[N]; ^ 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?