Borderou de evaluare (job #1254918)

Utilizator florin.elfusFlorin Elfus florin.elfus Data 3 noiembrie 2014 19:03:56
Problema Mafioti Status done
Runda Arhiva de probleme Compilator cpp | Vezi sursa
Scor 0

Raport evaluator

Eroare de compilare: user.cpp: In function ‘int main()’: user.cpp:24:9: error: reference to ‘prev’ is ambiguous prev[ptr] = i; ^ user.cpp:6:18: note: candidates are: int prev [5555] int banca[5555], prev[5555]; ^ 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:32:27: error: reference to ‘prev’ is ambiguous int maf = j - prev[j]; ^ user.cpp:6:18: note: candidates are: int prev [5555] int banca[5555], prev[5555]; ^ 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:33:58: error: reference to ‘prev’ is ambiguous dp[1][i][j] = K + min(dp[0][max(0, i - maf)][prev[j]], dp[1][max(0, i - maf)][prev[j]]); ^ user.cpp:6:18: note: candidates are: int prev [5555] int banca[5555], prev[5555]; ^ 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:33:91: error: reference to ‘prev’ is ambiguous dp[1][i][j] = K + min(dp[0][max(0, i - maf)][prev[j]], dp[1][max(0, i - maf)][prev[j]]); ^ user.cpp:6:18: note: candidates are: int prev [5555] int banca[5555], prev[5555]; ^ 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:10:38: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]

Ceva nu functioneaza?