Rezumat problemă

SortSum

#3902

Scrie un program care citind un șir de numere naturale afișează numerele citite ordonate crescător după suma cifrelor lor, iar dacă suma cifrelor este egală, descrescător după valoarea lor.

Fișiere Popa Daniel (popadaniel72) Daniel Popa medie

Clasa 9 Tablouri unidimensionale (vectori) Sortarea vectorilor Sortare

Rezolvă

Detalii

Problema	SortSum	Operații I/O	sortsum.in/sortsum.out
Limita timp	0.4 secunde	Limita memorie	Total: 4.5 MB / Stivă 4 MB
Id soluție	#64974541	Utilizator	Mester Darius (Mesterel)
Fișier	sortsum.cpp	Dimensiune	673 B
Data încărcării	30 Iunie 2026, 18:04	Scor/rezultat	Eroare de compilare

Evaluare

Mesaj compilare

sortsum.cpp: In function ‘int main()’:
sortsum.cpp:29:25: error: no match for ‘operator=’ (operand types are ‘std::vector<int>’ and ‘int’)
   29 |         v[sumcif(nr)] = nr;
      |                         ^~
In file included from /usr/include/c++/13/vector:72,
                 from sortsum.cpp:5:
/usr/include/c++/13/bits/vector.tcc:210:5: note: candidate: ‘std::vector<_Tp, _Alloc>& std::vector<_Tp, _Alloc>::operator=(const std::vector<_Tp, _Alloc>&) [with _Tp = int; _Alloc = std::allocator<int>]’
  210 |     vector<_Tp, _Alloc>::
      |     ^~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/vector.tcc:211:42: note:   no known conversion for argument 1 from ‘int’ to ‘const std::vector<int>&’
  211 |     operator=(const vector<_Tp, _Alloc>& __x)
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
In file included from /usr/include/c++/13/vector:66:
/usr/include/c++/13/bits/stl_vector.h:766:7: note: candidate: ‘std::vector<_Tp, _Alloc>& std::vector<_Tp, _Alloc>::operator=(std::vector<_Tp, _Alloc>&&) [with _Tp = int; _Alloc = std::allocator<int>]’
  766 |       operator=(vector&& __x) noexcept(_Alloc_traits::_S_nothrow_move())
      |       ^~~~~~~~
/usr/include/c++/13/bits/stl_vector.h:766:26: note:   no known conversion for argument 1 from ‘int’ to ‘std::vector<int>&&’
  766 |       operator=(vector&& __x) noexcept(_Alloc_traits::_S_nothrow_move())
      |                 ~~~~~~~~~^~~
/usr/include/c++/13/bits/stl_vector.h:788:7: note: candidate: ‘std::vector<_Tp, _Alloc>& std::vector<_Tp, _Alloc>::operator=(std::initializer_list<_Tp>) [with _Tp = int; _Alloc = std::allocator<int>]’
  788 |       operator=(initializer_list<value_type> __l)
      |       ^~~~~~~~
/usr/include/c++/13/bits/stl_vector.h:788:46: note:   no known conversion for argument 1 from ‘int’ to ‘std::initializer_list<int>’
  788 |       operator=(initializer_list<value_type> __l)
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
sortsum.cpp:32:16: error: request for member ‘begin’ in ‘v’, which is of non-class type ‘std::vector<int> [64]’
   32 |         sort(v.begin(), v.end(), greater<int>());
      |                ^~~~~
sortsum.cpp:32:27: error: request for member ‘end’ in ‘v’, which is of non-class type ‘std::vector<int> [64]’
   32 |         sort(v.begin(), v.end(), greater<int>());
      |                           ^~~
sortsum.cpp:32:9: error: ‘sort’ was not declared in this scope; did you mean ‘short’?
   32 |         sort(v.begin(), v.end(), greater<int>());
      |         ^~~~
      |         short

Cum funcționează evaluarea?