Rezumat problemă

masterpiece001

#2366

Se dă un sir de numere naturale nenule.

Să se afișeze în ordine strict crescătoare toate numerele din șirul dat care au număr maxim de divizori.

Fișiere Horia Apostol (ApostolHoria) Horia Apostol dificilă

Clasa 9 Probleme diverse Probleme diverse Numararea divizorilor

Rezolvă

Detalii

Problema	masterpiece001	Operații I/O	masterpiece001.in/masterpiece001.out
Limita timp	0.25 secunde	Limita memorie	Total: 0.2 MB / Stivă 0 MB
Id soluție	#57819280	Utilizator	Alex Alex (acheron12)
Fișier	masterpiece001.cpp	Dimensiune	895 B
Data încărcării	21 Aprilie 2025, 21:14	Scor / rezultat	Eroare de compilare

Evaluare

Mesaj compilare

masterpiece001.cpp: In function 'int main()':
masterpiece001.cpp:28:25: error: no matching function for call to 'std::set<int>::set(int&)'
     set <int> divizori(n);

                         ^
masterpiece001.cpp:28:25: note: candidates are:
In file included from /usr/include/c++/4.8/set:61:0,
                 from masterpiece001.cpp:3:
/usr/include/c++/4.8/bits/stl_set.h:218:7: note: std::set<_Key, _Compare, _Alloc>::set(std::initializer_list<_Tp>, const _Compare&, const allocator_type&) [with _Key = int; _Compare = std::less<int>; _Alloc = std::allocator<int>; std::set<_Key, _Compare, _Alloc>::allocator_type = std::allocator<int>]
       set(initializer_list<value_type> __l,
       ^
/usr/include/c++/4.8/bits/stl_set.h:218:7: note:   no known conversion for argument 1 from 'int' to 'std::initializer_list<int>'
/usr/include/c++/4.8/bits/stl_set.h:204:7: note: std::set<_Key, _Compare, _Alloc>::set(std::set<_Key, _Compare, _Alloc>&&) [with _Key = int; _Compare = std::less<int>; _Alloc = std::allocator<int>]
       set(set&& __x)
       ^
/usr/include/c++/4.8/bits/stl_set.h:204:7: note:   no known conversion for argument 1 from 'int' to 'std::set<int>&&'
/usr/include/c++/4.8/bits/stl_set.h:193:7: note: std::set<_Key, _Compare, _Alloc>::set(const std::set<_Key, _Compare, _Alloc>&) [with _Key = int; _Compare = std::less<int>; _Alloc = std::allocator<int>]
       set(const set& __x)
       ^
/usr/include/c++/4.8/bits/stl_set.h:193:7: note:   no known conversion for argument 1 from 'int' to 'const std::set<int>&'
/usr/include/c++/4.8/bits/stl_set.h:180:2: note: template<class _InputIterator> std::set<_Key, _Compare, _Alloc>::set(_InputIterator, _InputIterator, const _Compare&, const allocator_type&)
  set(_InputIterator __first, _InputIterator __last,
  ^
/usr/include/c++/4.8/bits/stl_set.h:180:2: note:   template argument deduction/substitution failed:
masterpiece001.cpp:28:25: note:   candidate expects 4 arguments, 1 provided
     set <int> divizori(n);

                         ^
In file included from /usr/include/c++/4.8/set:61:0,
                 from masterpiece001.cpp:3:
/usr/include/c++/4.8/bits/stl_set.h:163:2: note: template<class _InputIterator> std::set<_Key, _Compare, _Alloc>::set(_InputIterator, _InputIterator)
  set(_InputIterator __first, _InputIterator __last)
  ^
/usr/include/c++/4.8/bits/stl_set.h:163:2: note:   template argument deduction/substitution failed:
masterpiece001.cpp:28:25: note:   candidate expects 2 arguments, 1 provided
     set <int> divizori(n);

                         ^
In file included from /usr/include/c++/4.8/set:61:0,
                 from masterpiece001.cpp:3:
/usr/include/c++/4.8/bits/stl_set.h:148:7: note: std::set<_Key, _Compare, _Alloc>::set(const _Compare&, const allocator_type&) [with _Key = int; _Compare = std::less<int>; _Alloc = std::allocator<int>; std::set<_Key, _Compare, _Alloc>::allocator_type = std::allocator<int>]
       set(const _Compare& __comp,
       ^
/usr/include/c++/4.8/bits/stl_set.h:148:7: note:   no known conversion for argument 1 from 'int' to 'const std::less<int>&'
/usr/include/c++/4.8/bits/stl_set.h:139:7: note: std::set<_Key, _Compare, _Alloc>::set() [with _Key = int; _Compare = std::less<int>; _Alloc = std::allocator<int>]
       set()
       ^
/usr/include/c++/4.8/bits/stl_set.h:139:7: note:   candidate expects 0 arguments, 1 provided

Cum funcționează evaluarea?