#4973
Natașa este o pisică foarte vorbăreață: ea poate pronunța toate vocalele (a, e, i, o, u) și consoana m. Am observat că mesajul pe care Natașa încearcă să mi-l transmită este o secvență dintr-o “frază” scrisă în limbaj pisicesc, care are un număr maxim de apariţii în frază. Dacă există mai multe secvențe cu număr maxim de apariții, mesajul este secvența cu lungimea cea mai mare. Scrieți un program care citește un șir de caractere, ce reprezintă o frază în limbaj pisicesc și rezolvă următoarele cerințe:
1. determină numărul de vocale distincte existente în frază;
2. determină de câte ori apare secvența mau în frază;
3. determină mesajul transmis de Natașa, conform regulilor de mai sus.
OJI 2026, clasa a 8-a
| Problema | pisicesc | Operații I/O |
pisicesc.in/pisicesc.out
|
|---|---|---|---|
| Limita timp | 0.1 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
| Id soluție | #64468988 | Utilizator | |
| Fișier | pisicesc.cpp | Dimensiune | 1.06 KB |
| Data încărcării | 08 Mai 2026, 16:03 | Scor/rezultat | Eroare de compilare |
pisicesc.cpp:8:33: error: use of deleted function ‘std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_map() [with _Key = std::vector<char>; _Tp = int; _Hash = std::hash<std::vector<char> >; _Pred = std::equal_to<std::vector<char> >; _Alloc = std::allocator<std::pair<const std::vector<char>, int> >]’ 8 | unordered_map<vector<char>,int> fr; | ^~ In file included from /usr/include/c++/13/unordered_map:41, from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:188, from pisicesc.cpp:1: /usr/include/c++/13/bits/unordered_map.h:148:7: note: ‘std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_map() [with _Key = std::vector<char>; _Tp = int; _Hash = std::hash<std::vector<char> >; _Pred = std::equal_to<std::vector<char> >; _Alloc = std::allocator<std::pair<const std::vector<char>, int> >]’ is implicitly deleted because the default definition would be ill-formed: 148 | unordered_map() = default; | ^~~~~~~~~~~~~ /usr/include/c++/13/bits/unordered_map.h:148:7: error: use of deleted function ‘std::_Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal, _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::_Hashtable() [with _Key = std::vector<char>; _Value = std::pair<const std::vector<char>, int>; _Alloc = std::allocator<std::pair<const std::vector<char>, int> >; _ExtractKey = std::__detail::_Select1st; _Equal = std::equal_to<std::vector<char> >; _Hash = std::hash<std::vector<char> >; _RangeHash = std::__detail::_Mod_range_hashing; _Unused = std::__detail::_Default_ranged_hash; _RehashPolicy = std::__detail::_Prime_rehash_policy; _Traits = std::__detail::_Hashtable_traits<true, false, true>]’ In file included from /usr/include/c++/13/bits/unordered_map.h:33: /usr/include/c++/13/bits/hashtable.h:530:7: note: ‘std::_Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal, _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::_Hashtable() [with _Key = std::vector<char>; _Value = std::pair<const std::vector<char>, int>; _Alloc = std::allocator<std::pair<const std::vector<char>, int> >; _ExtractKey = std::__detail::_Select1st; _Equal = std::equal_to<std::vector<char> >; _Hash = std::hash<std::vector<char> >; _RangeHash = std::__detail::_Mod_range_hashing; _Unused = std::__detail::_Default_ranged_hash; _RehashPolicy = std::__detail::_Prime_rehash_policy; _Traits = std::__detail::_Hashtable_traits<true, false, true>]’ is implicitly deleted because the default definition would be ill-formed: 530 | _Hashtable() = default; | ^~~~~~~~~~ /usr/include/c++/13/bits/hashtable.h:530:7: error: use of deleted function ‘std::__detail::_Hashtable_base<_Key, _Value, _ExtractKey, _Equal, _Hash, _RangeHash, _Unused, _Traits>::_Hashtable_base() [with _Key = std::vector<char>; _Value = std::pair<const std::vector<char>, int>; _ExtractKey = std::__detail::_Select1st; _Equal = std::equal_to<std::vector<char> >; _Hash = std::hash<std::vector<char> >; _RangeHash = std::__detail::_Mod_range_hashing; _Unused = std::__detail::_Default_ranged_hash; _Traits = std::__detail::_Hashtable_traits<true, false, true>]’ In file included from /usr/include/c++/13/bits/hashtable.h:35: /usr/include/c++/13/bits/hashtable_policy.h:1701:7: note: ‘std::__detail::_Hashtable_base<_Key, _Value, _ExtractKey, _Equal, _Hash, _RangeHash, _Unused, _Traits>::_Hashtable_base() [with _Key = std::vector<char>; _Value = std::pair<const std::vector<char>, int>; _ExtractKey = std::__detail::_Select1st; _Equal = std::equal_to<std::vector<char> >; _Hash = std::hash<std::vector<char> >; _RangeHash = std::__detail::_Mod_range_hashing; _Unused = std::__detail::_Default_ranged_hash; _Traits = std::__detail::_Hashtable_traits<true, false, true>]’ is implicitly deleted because the default definition would be ill-formed: 1701 | _Hashtable_base() = default; | ^~~~~~~~~~~~~~~ /usr/include/c++/13/bits/hashtable_policy.h:1701:7: error: use of deleted function ‘std::__detail::_Hash_code_base<_Key, _Value, _ExtractKey, _Hash, _RangeHash, _Unused, __cache_hash_code>::_Hash_code_base() [with _Key = std::vector<char>; _Value = std::pair<const std::vector<char>, int>; _ExtractKey = std::__detail::_Select1st; _Hash = std::hash<std::vector<char> >; _RangeHash = std::__detail::_Mod_range_hashing; _Unused = std::__detail::_Default_ranged_hash; bool __cache_hash_code = true]’ /usr/include/c++/13/bits/hashtable_policy.h: In instantiation of ‘std::__detail::_Hashtable_ebo_helper<_Nm, _Tp, true>::_Hashtable_ebo_helper() [with int _Nm = 1; _Tp = std::hash<std::vector<char> >]’: /usr/include/c++/13/bits/hashtable_policy.h:1301:7: required from here /usr/include/c++/13/bits/hashtable_policy.h:1218:49: error: use of deleted function ‘std::hash<std::vector<char> >::hash()’ 1218 | _Hashtable_ebo_helper() noexcept(noexcept(_Tp())) : _Tp() { } | ^~~~~ In file included from /usr/include/c++/13/bits/basic_string.h:4391, from /usr/include/c++/13/string:54, from /usr/include/c++/13/bitset:52, from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:52: /usr/include/c++/13/bits/functional_hash.h:102:12: note: ‘std::hash<std::vector<char> >::hash()’ is implicitly deleted because the default definition would be ill-formed: 102 | struct hash : __hash_enum<_Tp> | ^~~~ /usr/include/c++/13/bits/functional_hash.h:102:12: error: no matching function for call to ‘std::__hash_enum<std::vector<char>, false>::__hash_enum()’ /usr/include/c++/13/bits/functional_hash.h:83:7: note: candidate: ‘std::__hash_enum<_Tp, <anonymous> >::__hash_enum(std::__hash_enum<_Tp, <anonymous> >&&) [with _Tp = std::vector<char>; bool <anonymous> = false]’ 83 | __hash_enum(__hash_enum&&); | ^~~~~~~~~~~ /usr/include/c++/13/bits/functional_hash.h:83:7: note: candidate expects 1 argument, 0 provided /usr/include/c++/13/bits/functional_hash.h:102:12: error: ‘std::__hash_enum<_Tp, <anonymous> >::~__hash_enum() [with _Tp = std::vector<char>; bool <anonymous> = false]’ is private within this context 102 | struct hash : __hash_enum<_Tp> | ^~~~ /usr/include/c++/13/bits/functional_hash.h:84:7: note: declared private here 84 | ~__hash_enum(); | ^ /usr/include/c++/13/bits/hashtable_policy.h:1301:7: note: ‘std::__detail::_Hash_code_base<_Key, _Value, _ExtractKey, _Hash, _RangeHash, _Unused, __cache_hash_code>::_Hash_code_base() [with _Key = std::vector<char>; _Value = std::pair<const std::vector<char>, int>; _ExtractKey = std::__detail::_Select1st; _Hash = std::hash<std::vector<char> >; _RangeHash = std::__detail::_Mod_range_hashing; _Unused = std::__detail::_Default_ranged_hash; bool __cache_hash_code = true]’ is implicitly deleted because the default definition would be ill-formed: 1301 | _Hash_code_base() = default; | ^~~~~~~~~~~~~~~ /usr/include/c++/13/bits/hashtable_policy.h:1301:7: error: use of deleted function ‘std::__detail::_Hashtable_ebo_helper<1, std::hash<std::vector<char> >, true>::~_Hashtable_ebo_helper()’ /usr/include/c++/13/bits/hashtable_policy.h:1215:12: note: ‘std::__detail::_Hashtable_ebo_helper<1, std::hash<std::vector<char> >, true>::~_Hashtable_ebo_helper()’ is implicitly deleted because the default definition would be ill-formed: 1215 | struct _Hashtable_ebo_helper<_Nm, _Tp, true> | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13/bits/hashtable_policy.h:1215:12: error: use of deleted function ‘std::hash<std::vector<char> >::~hash()’ /usr/include/c++/13/bits/functional_hash.h:102:12: note: ‘std::hash<std::vector<char> >::~hash()’ is implicitly deleted because the default definition would be ill-formed: 102 | struct hash : __hash_enum<_Tp> | ^~~~ /usr/include/c++/13/bits/functional_hash.h:102:12: error: ‘std::__hash_enum<_Tp, <anonymous> >::~__hash_enum() [with _Tp = std::vector<char>; bool <anonymous> = false]’ is private within this context /usr/include/c++/13/bits/functional_hash.h:84:7: note: declared private here 84 | ~__hash_enum(); | ^ /usr/include/c++/13/bits/hashtable_policy.h:1701:7: error: use of deleted function ‘std::__detail::_Hash_code_base<std::vector<char>, std::pair<const std::vector<char>, int>, std::__detail::_Select1st, std::hash<std::vector<char> >, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, true>::~_Hash_code_base()’ 1701 | _Hashtable_base() = default; | ^~~~~~~~~~~~~~~ /usr/include/c++/13/bits/hashtable_policy.h:1279:12: note: ‘std::__detail::_Hash_code_base<std::vector<char>, std::pair<const std::vector<char>, int>, std::__detail::_Select1st, std::hash<std::vector<char> >, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, true>::~_Hash_code_base()’ is implicitly deleted because the default definition would be ill-formed: 1279 | struct _Hash_code_base | ^~~~~~~~~~~~~~~ /usr/include/c++/13/bits/hashtable_policy.h:1279:12: error: use of deleted function ‘std::__detail::_Hashtable_ebo_helper<1, std::hash<std::vector<char> >, true>::~_Hashtable_ebo_helper()’ /usr/include/c++/13/bits/hashtable.h:530:7: error: use of deleted function ‘std::__detail::_Hashtable_base<std::vector<char>, std::pair<const std::vector<char>, int>, std::__detail::_Select1st, std::equal_to<std::vector<char> >, std::hash<std::vector<char> >, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Hashtable_traits<true, false, true> >::~_Hashtable_base()’ 530 | _Hashtable() = default; | ^~~~~~~~~~ /usr/include/c++/13/bits/hashtable_policy.h:1658:12: note: ‘std::__detail::_Hashtable_base<std::vector<char>, std::pair<const std::vector<char>, int>, std::__detail::_Select1st, std::equal_to<std::vector<char> >, std::hash<std::vector<char> >, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Hashtable_traits<true, false, true> >::~_Hashtable_base()’ is implicitly deleted because the default definition would be ill-formed: 1658 | struct _Hashtable_base | ^~~~~~~~~~~~~~~ /usr/include/c++/13/bits/hashtable_policy.h:1658:12: error: use of deleted function ‘std::__detail::_Hash_code_base<std::vector<char>, std::pair<const std::vector<char>, int>, std::__detail::_Select1st, std::hash<std::vector<char> >, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, true>::~_Hash_code_base()’ /usr/include/c++/13/bits/hashtable.h:530:7: error: use of deleted function ‘constexpr std::_Enable_default_constructor<false, _Tag>::_Enable_default_constructor() [with _Tag = std::__detail::_Hash_node_base]’ 530 | _Hashtable() = default; | ^~~~~~~~~~ In file included from /usr/include/c++/13/bits/hashtable.h:36: /usr/include/c++/13/bits/enable_special_members.h:113:15: note: declared here 113 | constexpr _Enable_default_constructor() noexcept = delete; | ^~~~~~~~~~~~~~~~~~~~~~~~~~~ pisicesc.cpp: In function ‘int main()’: pisicesc.cpp:61:33: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector<char>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 61 | if(it.second==maxim&&lungime<it.first.size()) | ~~~~~~~^~~~~~~~~~~~~~~~ pisicesc.cpp:65:45: warning: comparison of integer expressions of different signedness: ‘std::vector<char>::size_type’ {aka ‘long unsigned int’} and ‘int’ [-Wsign-compare] 65 | {if(it.second==maxim&&ok==0&&it.first.size()==lungime) | ~~~~~~~~~~~~~~~^~~~~~~~~ pisicesc.cpp:66:11: warning: comparison of integer expressions of different signedness: ‘char’ and ‘std::vector<char>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 66 | {for(x=0;x<it.first.size();x++) | ~^~~~~~~~~~~~~~~~ pisicesc.cpp:68:3: warning: statement has no effect [-Wunused-value] 68 | ok==1; | ~~^~~ /usr/include/c++/13/bits/hashtable_policy.h: In instantiation of ‘std::__detail::_Hash_code_base<_Key, _Value, _ExtractKey, _Hash, _RangeHash, _Unused, __cache_hash_code>::__hash_code std::__detail::_Hash_code_base<_Key, _Value, _ExtractKey, _Hash, _RangeHash, _Unused, __cache_hash_code>::_M_hash_code(const _Key&) const [with _Key = std::vector<char>; _Value = std::pair<const std::vector<char>, int>; _ExtractKey = std::__detail::_Select1st; _Hash = std::hash<std::vector<char> >; _RangeHash = std::__detail::_Mod_range_hashing; _Unused = std::__detail::_Default_ranged_hash; bool __cache_hash_code = true; __hash_code = long unsigned int]’: /usr/include/c++/13/bits/hashtable_policy.h:813:45: required from ‘std::__detail::_Map_base<_Key, std::pair<const _Key, _Tp>, _Alloc, std::__detail::_Select1st, _Equal, _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits, true>::mapped_type& std::__detail::_Map_base<_Key, std::pair<const _Key, _Tp>, _Alloc, std::__detail::_Select1st, _Equal, _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits, true>::operator[](const key_type&) [with _Key = std::vector<char>; _Val = int; _Alloc = std::allocator<std::pair<const std::vector<char>, int> >; _Equal = std::equal_to<std::vector<char> >; _Hash = std::hash<std::vector<char> >; _RangeHash = std::__detail::_Mod_range_hashing; _Unused = std::__detail::_Default_ranged_hash; _RehashPolicy = std::__detail::_Prime_rehash_policy; _Traits = std::__detail::_Hashtable_traits<true, false, true>; mapped_type = int; key_type = std::vector<char>]’ /usr/include/c++/13/bits/unordered_map.h:987:20: required from ‘std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::mapped_type& std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::operator[](const key_type&) [with _Key = std::vector<char>; _Tp = int; _Hash = std::hash<std::vector<char> >; _Pred = std::equal_to<std::vector<char> >; _Alloc = std::allocator<std::pair<const std::vector<char>, int> >; mapped_type = int; key_type = std::vector<char>]’ pisicesc.cpp:51:5: required from here /usr/include/c++/13/bits/hashtable_policy.h:1308:23: error: static assertion failed: hash function must be invocable with an argument of key type 1308 | static_assert(__is_invocable<const _Hash&, const _Key&>{}, | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13/bits/hashtable_policy.h:1308:23: note: ‘std::__is_invocable<const std::hash<std::vector<char> >&, const std::vector<char, std::allocator<char> >&>()’ evaluates to false /usr/include/c++/13/bits/hashtable_policy.h:1310:25: error: no match for call to ‘(const std::hash<std::vector<char> >) (const std::vector<char>&)’ 1310 | return _M_hash()(__k); | ~~~~~~~~~^~~~~ /usr/include/c++/13/bits/hashtable.h: In instantiation of ‘std::_Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal, _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::~_Hashtable() [with _Key = std::vector<char>; _Value = std::pair<const std::vector<char>, int>; _Alloc = std::allocator<std::pair<const std::vector<char>, int> >; _ExtractKey = std::__detail::_Select1st; _Equal = std::equal_to<std::vector<char> >; _Hash = std::hash<std::vector<char> >; _RangeHash = std::__detail::_Mod_range_hashing; _Unused = std::__detail::_Default_ranged_hash; _RehashPolicy = std::__detail::_Prime_rehash_policy; _Traits = std::__detail::_Hashtable_traits<true, false, true>]’: /usr/include/c++/13/bits/unordered_map.h:109:11: required from here /usr/include/c++/13/bits/hashtable.h:1610:5: error: use of deleted function ‘std::__detail::_Hashtable_base<std::vector<char>, std::pair<const std::vector<char>, int>, std::__detail::_Select1st, std::equal_to<std::vector<char> >, std::hash<std::vector<char> >, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Hashtable_traits<true, false, true> >::~_Hashtable_base()’ 1610 | } | ^
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema pisicesc face parte din prima categorie. Soluția propusă de tine va fi evaluată astfel:
Suma punctajelor acordate pe testele utilizate pentru verificare este 100. Astfel, soluția ta poate obține cel mult 100 de puncte, caz în care se poate considera corectă.