Borderou de evaluare (job #1477688)

Utilizator fluture.godlikeGafton Mihnea Alexandru fluture.godlike Data 26 august 2015 19:23:09
Problema Energii Status done
Runda Arhiva de probleme Compilator cpp | Vezi sursa
Scor 0

Raport evaluator

Eroare de compilare: user.cpp: In function ‘void citire()’: user.cpp:22:9: error: reference to ‘prev’ is ambiguous prev = !line; ^ user.cpp:10:23: note: candidates are: int prev int g, w, e, c, line, prev, dp[2][WMAX]; ^ In file included from /usr/include/c++/4.8/bits/stl_algobase.h:66:0, from /usr/include/c++/4.8/algorithm:61, from user.cpp:2: /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:25:30: error: reference to ‘prev’ is ambiguous dp[line][j] = dp[prev][j]; ^ user.cpp:10:23: note: candidates are: int prev int g, w, e, c, line, prev, dp[2][WMAX]; ^ In file included from /usr/include/c++/4.8/bits/stl_algobase.h:66:0, from /usr/include/c++/4.8/algorithm:61, from user.cpp:2: /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:28:38: error: reference to ‘prev’ is ambiguous dp[line][j] = min(dp[prev][j], dp[prev][j-e] + c); ^ user.cpp:10:23: note: candidates are: int prev int g, w, e, c, line, prev, dp[2][WMAX]; ^ In file included from /usr/include/c++/4.8/bits/stl_algobase.h:66:0, from /usr/include/c++/4.8/algorithm:61, from user.cpp:2: /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:28:51: error: reference to ‘prev’ is ambiguous dp[line][j] = min(dp[prev][j], dp[prev][j-e] + c); ^ user.cpp:10:23: note: candidates are: int prev int g, w, e, c, line, prev, dp[2][WMAX]; ^ In file included from /usr/include/c++/4.8/bits/stl_algobase.h:66:0, from /usr/include/c++/4.8/algorithm:61, from user.cpp:2: /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:17:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]

Ceva nu functioneaza?