Rezumat problemă

porumbei

#2059

2 numere puse în aşa fel încât rezultatul aX – aY să fie divizibil cu n. X și Y sunt numerele de pe inelele porumbeilor pe care îi va trimite la concurs.

Concursul Interjudețean de Informatică "Spiru Haret" Targu Jiu, Ed. II

Fișiere Prof C.N. (flaviusboian) Flavius Boian medie

Clasa 9 Tablouri unidimensionale (vectori) Vectori caracteristici / de frecventa

Rezolvă

Detalii

Problema	porumbei	Operații I/O	porumbei.in/porumbei.out
Limita timp	0.1 secunde	Limita memorie	Total: 1 MB / Stivă 1 MB
Id soluție	#63277240	Utilizator	Dorneanu Denis-Daniel (denisdaniel)
Fișier	porumbei.cpp	Dimensiune	590 B
Data încărcării	24 Februarie 2026, 15:45	Scor/rezultat	Eroare de compilare

Evaluare

Mesaj compilare

porumbei.cpp: In function 'int main()':
porumbei.cpp:21:33: error: no matching function for call to 'std::map<int, int>::map(int, <brace-enclosed initializer list>)'
     map<int, int> ap(n+1, {0, 0});

                                 ^
porumbei.cpp:21:33: note: candidates are:
In file included from /usr/include/c++/4.8/map:61:0,
                 from porumbei.cpp:7:
/usr/include/c++/4.8/bits/stl_map.h:241:9: note: template<class _InputIterator> std::map<_Key, _Tp, _Compare, _Alloc>::map(_InputIterator, _InputIterator, const _Compare&, const allocator_type&)
         map(_InputIterator __first, _InputIterator __last,
         ^
/usr/include/c++/4.8/bits/stl_map.h:241:9: note:   template argument deduction/substitution failed:
porumbei.cpp:21:33: note:   candidate expects 4 arguments, 2 provided
     map<int, int> ap(n+1, {0, 0});

                                 ^
In file included from /usr/include/c++/4.8/map:61:0,
                 from porumbei.cpp:7:
/usr/include/c++/4.8/bits/stl_map.h:224:9: note: std::map<_Key, _Tp, _Compare, _Alloc>::map(_InputIterator, _InputIterator) [with _InputIterator = int; _Key = int; _Tp = int; _Compare = std::less<int>; _Alloc = std::allocator<std::pair<const int, int> >]
         map(_InputIterator __first, _InputIterator __last)
         ^
/usr/include/c++/4.8/bits/stl_map.h:224:9: note:   no known conversion for argument 2 from '<brace-enclosed initializer list>' to 'int'
/usr/include/c++/4.8/bits/stl_map.h:206:7: note: std::map<_Key, _Tp, _Compare, _Alloc>::map(std::initializer_list<std::pair<const _Key, _Tp> >, const _Compare&, const allocator_type&) [with _Key = int; _Tp = int; _Compare = std::less<int>; _Alloc = std::allocator<std::pair<const int, int> >; std::map<_Key, _Tp, _Compare, _Alloc>::allocator_type = std::allocator<std::pair<const int, int> >]
       map(initializer_list<value_type> __l,
       ^
/usr/include/c++/4.8/bits/stl_map.h:206:7: note:   no known conversion for argument 1 from 'int' to 'std::initializer_list<std::pair<const int, int> >'
/usr/include/c++/4.8/bits/stl_map.h:191:7: note: std::map<_Key, _Tp, _Compare, _Alloc>::map(std::map<_Key, _Tp, _Compare, _Alloc>&&) [with _Key = int; _Tp = int; _Compare = std::less<int>; _Alloc = std::allocator<std::pair<const int, int> >]
       map(map&& __x)
       ^
/usr/include/c++/4.8/bits/stl_map.h:191:7: note:   candidate expects 1 argument, 2 provided
/usr/include/c++/4.8/bits/stl_map.h:180:7: note: std::map<_Key, _Tp, _Compare, _Alloc>::map(const std::map<_Key, _Tp, _Compare, _Alloc>&) [with _Key = int; _Tp = int; _Compare = std::less<int>; _Alloc = std::allocator<std::pair<const int, int> >]
       map(const map& __x)
       ^
/usr/include/c++/4.8/bits/stl_map.h:180:7: note:   candidate expects 1 argument, 2 provided
/usr/include/c++/4.8/bits/stl_map.h:169:7: note: std::map<_Key, _Tp, _Compare, _Alloc>::map(const _Compare&, const allocator_type&) [with _Key = int; _Tp = int; _Compare = std::less<int>; _Alloc = std::allocator<std::pair<const int, int> >; std::map<_Key, _Tp, _Compare, _Alloc>::allocator_type = std::allocator<std::pair<const int, int> >]
       map(const _Compare& __comp,
       ^
/usr/include/c++/4.8/bits/stl_map.h:169:7: note:   no known conversion for argument 1 from 'int' to 'const std::less<int>&'
/usr/include/c++/4.8/bits/stl_map.h:160:7: note: std::map<_Key, _Tp, _Compare, _Alloc>::map() [with _Key = int; _Tp = int; _Compare = std::less<int>; _Alloc = std::allocator<std::pair<const int, int> >]
       map()
       ^
/usr/include/c++/4.8/bits/stl_map.h:160:7: note:   candidate expects 0 arguments, 2 provided

Cum funcționează evaluarea?