Borderou de evaluare (job #818896)

Utilizator vlad.doruIon Vlad-Doru vlad.doru Data 18 noiembrie 2012 11:23:49
Problema Cifre3 Status done
Runda Arhiva Monthly Compilator cpp | Vezi sursa
Scor 0

Raport evaluator

Eroare de compilare: user.cpp: In function ‘void generate(int)’: user.cpp:21: error: no match for ‘operator=’ in ‘it = possible[0].std::tr1::unordered_map<int, bool, std::tr1::hash<int>, std::equal_to<int>, std::allocator<std::pair<const int, bool> > >::<anonymous>.std::tr1::__unordered_map<int, bool, std::tr1::hash<int>, std::equal_to<int>, std::allocator<std::pair<const int, bool> >, false>::<anonymous>.std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::begin [with _Key = int, _Value = std::pair<const int, bool>, _Allocator = std::allocator<std::pair<const int, bool> >, _ExtractKey = std::_Select1st<std::pair<const int, bool> >, _Equal = std::equal_to<int>, _H1 = std::tr1::hash<int>, _H2 = std::tr1::__detail::_Mod_range_hashing, _Hash = std::tr1::__detail::_Default_ranged_hash, _RehashPolicy = std::tr1::__detail::_Prime_rehash_policy, bool __cache_hash_code = false, bool __constant_iterators = false, bool __unique_keys = true]()’ /usr/include/c++/4.4/bits/stl_tree.h:154: note: candidates are: std::_Rb_tree_iterator<std::pair<const int, bool> >& std::_Rb_tree_iterator<std::pair<const int, bool> >::operator=(const std::_Rb_tree_iterator<std::pair<const int, bool> >&) user.cpp:21: error: no match for ‘operator!=’ in ‘it != possible[0].std::tr1::unordered_map<int, bool, std::tr1::hash<int>, std::equal_to<int>, std::allocator<std::pair<const int, bool> > >::<anonymous>.std::tr1::__unordered_map<int, bool, std::tr1::hash<int>, std::equal_to<int>, std::allocator<std::pair<const int, bool> >, false>::<anonymous>.std::tr1::_Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, __cache_hash_code, __constant_iterators, __unique_keys>::end [with _Key = int, _Value = std::pair<const int, bool>, _Allocator = std::allocator<std::pair<const int, bool> >, _ExtractKey = std::_Select1st<std::pair<const int, bool> >, _Equal = std::equal_to<int>, _H1 = std::tr1::hash<int>, _H2 = std::tr1::__detail::_Mod_range_hashing, _Hash = std::tr1::__detail::_Default_ranged_hash, _RehashPolicy = std::tr1::__detail::_Prime_rehash_policy, bool __cache_hash_code = false, bool __constant_iterators = false, bool __unique_keys = true]()’ /usr/include/c++/4.4/bits/stl_tree.h:216: note: candidates are: bool std::_Rb_tree_iterator<_Tp>::operator!=(const std::_Rb_tree_iterator<_Tp>&) const [with _Tp = std::pair<const int, bool>] user.cpp: In function ‘int main()’: user.cpp:32: warning: unused variable ‘i’ user.cpp:32: warning: unused variable ‘j’

Ceva nu functioneaza?