Eroare de compilare: main.cpp: In function 'int main()': main.cpp:20:23: error: no matching function for call to 'std::unordered_set<std::bitset<1013ul> >::insert(std::bitset<1002ul>&)' usu.insert(act); ^ In file included from /usr/include/c++/6/unordered_set:48:0, from /usr/include/x86_64-linux-gnu/c++/6/bits/stdc++.h:118, from main.cpp:1: /usr/include/c++/6/bits/unordered_set.h:412:7: note: candidate: std::pair<typename std::_Hashtable<_Value, _Value, _Alloc, std::__detail::_Identity, _Pred, _Hash, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Prime_rehash_policy, std::__detail::_Hashtable_traits<std::__not_<std::__and_<std::__is_fast_hash<_Hash>, std::__detail::__is_noexcept_hash<_Tp, _Hash> > >::value, true, true> >::iterator, bool> std::unordered_set<_Value, _Hash, _Pred, _Alloc>::insert(const value_type&) [with _Value = std::bitset<1013ul>; _Hash = std::hash<std::bitset<1013ul> >; _Pred = std::equal_to<std::bitset<1013ul> >; _Alloc = std::allocator<std::bitset<1013ul> >; typename std::_Hashtable<_Value, _Value, _Alloc, std::__detail::_Identity, _Pred, _Hash, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Prime_rehash_policy, std::__detail::_Hashtable_traits<std::__not_<std::__and_<std::__is_fast_hash<_Hash>, std::__detail::__is_noexcept_hash<_Tp, _Hash> > >::value, true, true> >::iterator = std::__detail::_Node_iterator<std::bitset<1013ul>, true, false>; std::unordered_set<_Value, _Hash, _Pred, _Alloc>::value_type = std::bitset<1013ul>] insert(const value_type& __x) ^~~~~~ /usr/include/c++/6/bits/unordered_set.h:412:7: note: no known conversion for argument 1 from 'std::bitset<1002ul>' to 'const value_type& {aka const std::bitset<1013ul>&}' /usr/include/c++/6/bits/unordered_set.h:416:7: note: candidate: std::pair<typename std::_Hashtable<_Value, _Value, _Alloc, std::__detail::_Identity, _Pred, _Hash, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Prime_rehash_policy, std::__detail::_Hashtable_traits<std::__not_<std::__and_<std::__is_fast_hash<_Hash>, std::__detail::__is_noexcept_hash<_Tp, _Hash> > >::value, true, true> >::iterator, bool> std::unordered_set<_Value, _Hash, _Pred, _Alloc>::insert(std::unordered_set<_Value, _Hash, _Pred, _Alloc>::value_type&&) [with _Value = std::bitset<1013ul>; _Hash = std::hash<std::bitset<1013ul> >; _Pred = std::equal_to<std::bitset<1013ul> >; _Alloc = std::allocator<std::bitset<1013ul> >; typename std::_Hashtable<_Value, _Value, _Alloc, std::__detail::_Identity, _Pred, _Hash, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Prime_rehash_policy, std::__detail::_Hashtable_traits<std::__not_<std::__and_<std::__is_fast_hash<_Hash>, std::__detail::__is_noexcept_hash<_Tp, _Hash> > >::value, true, true> >::iterator = std::__detail::_Node_iterator<std::bitset<1013ul>, true, false>; std::unordered_set<_Value, _Hash, _Pred, _Alloc>::value_type = std::bitset<1013ul>] insert(value_type&& __x) ^~~~~~ /usr/include/c++/6/bits/unordered_set.h:416:7: note: no known conversion for argument 1 from 'std::bitset<1002ul>' to 'std::unordered_set<std::bitset<1013ul> >::value_type&& {aka std::bitset<1013ul>&&}' /usr/include/c++/6/bits/unordered_set.h:441:7: note: candidate: std::unordered_set<_Value, _Hash, _Pred, _Alloc>::iterator std::unordered_set<_Value, _Hash, _Pred, _Alloc>::insert(std::unordered_set<_Value, _Hash, _Pred, _Alloc>::const_iterator, const value_type&) [with _Value = std::bitset<1013ul>; _Hash = std::hash<std::bitset<1013ul> >; _Pred = std::equal_to<std::bitset<1013ul> >; _Alloc = std::allocator<std::bitset<1013ul> >; std::unordered_set<_Value, _Hash, _Pred, _Alloc>::iterator = std::__detail::_Node_iterator<std::bitset<1013ul>, true, false>; std::unordered_set<_Value, _Hash, _Pred, _Alloc>::const_iterator = std::__detail::_Node_const_iterator<std::bitset<1013ul>, true, false>; std::unordered_set<_Value, _Hash, _Pred, _Alloc>::value_type = std::bitset<1013ul>] insert(const_iterator __hint, const value_type& __x) ^~~~~~ /usr/include/c++/6/bits/unordered_set.h:441:7: note: candidate expects 2 arguments, 1 provided /usr/include/c++/6/bits/unordered_set.h:445:7: note: candidate: std::unordered_set<_Value, _Hash, _Pred, _Alloc>::iterator std::unordered_set<_Value, _Hash, _Pred, _Alloc>::insert(std::unordered_set<_Value, _Hash, _Pred, _Alloc>::const_iterator, std::unordered_set<_Value, _Hash, _Pred, _Alloc>::value_type&&) [with _Value = std::bitset<1013ul>; _Hash = std::hash<std::bitset<1013ul> >; _Pred = std::equal_to<std::bitset<1013ul> >; _Alloc = std::allocator<std::bitset<1013ul> >; std::unordered_set<_Value, _Hash, _Pred, _Alloc>::iterator = std::__detail::_Node_iterator<std::bitset<1013ul>, true, false>; std::unordered_set<_Value, _Hash, _Pred, _Alloc>::const_iterator = std::__detail::_Node_const_iterator<std::bitset<1013ul>, true, false>; std::unordered_set<_Value, _Hash, _Pred, _Alloc>::value_type = std::bitset<1013ul>] insert(const_iterator __hint, value_type&& __x) ^~~~~~ /usr/include/c++/6/bits/unordered_set.h:445:7: note: candidate expects 2 arguments, 1 provided /usr/include/c++/6/bits/unordered_set.h:460:2: note: candidate: template<class _InputIterator> void std::unordered_set<_Value, _Hash, _Pred, _Alloc>::insert(_InputIterator, _InputIterator) [with _InputIterator = _InputIterator; _Value = std::bitset<1013ul>; _Hash = std::hash<std::bitset<1013ul> >; _Pred = std::equal_to<std::bitset<1013ul> >; _Alloc = std::allocator<std::bitset<1013ul> >] insert(_InputIterator __first, _InputIterator __last) ^~~~~~ /usr/include/c++/6/bits/unordered_set.h:460:2: note: template argument deduction/substitution failed: main.cpp:20:23: note: candidate expects 2 arguments, 1 provided usu.insert(act); ^ In file included from /usr/include/c++/6/unordered_set:48:0, from /usr/include/x86_64-linux-gnu/c++/6/bits/stdc++.h:118, from main.cpp:1: /usr/include/c++/6/bits/unordered_set.h:471:7: note: candidate: void std::unordered_set<_Value, _Hash, _Pred, _Alloc>::insert(std::initializer_list<typename std::_Hashtable<_Value, _Value, _Alloc, std::__detail::_Identity, _Pred, _Hash, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Prime_rehash_policy, std::__detail::_Hashtable_traits<std::__not_<std::__and_<std::__is_fast_hash<_Hash>, std::__detail::__is_noexcept_hash<_Tp, _Hash> > >::value, true, true> >::value_type>) [with _Value = std::bitset<1013ul>; _Hash = std::hash<std::bitset<1013ul> >; _Pred = std::equal_to<std::bitset<1013ul> >; _Alloc = std::allocator<std::bitset<1013ul> >; typename std::_Hashtable<_Value, _Value, _Alloc, std::__detail::_Identity, _Pred, _Hash, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Prime_rehash_policy, std::__detail::_Hashtable_traits<std::__not_<std::__and_<std::__is_fast_hash<_Hash>, std::__detail::__is_noexcept_hash<_Tp, _Hash> > >::value, true, true> >::value_type = std::bitset<1013ul>] insert(initializer_list<value_type> __l) ^~~~~~ /usr/include/c++/6/bits/unordered_set.h:471:7: note: no known conversion for argument 1 from 'std::bitset<1002ul>' to 'std::initializer_list<std::bitset<1013ul> >' Non zero exit status: 1