Rezumat problemă

MaxAndAp

#346

Să se scrie un program care citește un șir de n numere naturale şi determină valoarea maximă din șir și de câte ori apare.

Consola Candale Silviu (silviu) ușoară

Clasa 9 Algoritmi elementari Maxime și minime

Rezolvă

Detalii

Problema	MaxAndAp	Operații I/O	tastatură/ecran
Limita timp	0.1 secunde	Limita memorie	Total: 64 MB / Stivă 8 MB
Id soluție	#64487482	Utilizator	Munceleanu Vanessa (Vanessa_Munceleanu)
Fișier	maxandap.cpp	Dimensiune	390 B
Data încărcării	10 Mai 2026, 18:44	Scor/rezultat	Eroare de compilare

Evaluare

Mesaj compilare

maxandap.cpp: In function ‘int main()’:
maxandap.cpp:8:10: error: ‘i’ was not declared in this scope
    8 |     for (i = 1; i <= n; i++)
      |          ^
maxandap.cpp:11:27: error: reference to ‘max’ is ambiguous
   11 |         if (i == 1 || x > max)
      |                           ^~~
In file included from /usr/include/c++/13/string:51,
                 from /usr/include/c++/13/bits/locale_classes.h:40,
                 from /usr/include/c++/13/bits/ios_base.h:41,
                 from /usr/include/c++/13/ios:44,
                 from /usr/include/c++/13/ostream:40,
                 from /usr/include/c++/13/iostream:41,
                 from maxandap.cpp:1:
/usr/include/c++/13/bits/stl_algobase.h:303:5: note: candidates are: ‘template<class _Tp, class _Compare> const _Tp& std::max(const _Tp&, const _Tp&, _Compare)’
  303 |     max(const _Tp& __a, const _Tp& __b, _Compare __comp)
      |     ^~~
/usr/include/c++/13/bits/stl_algobase.h:257:5: note:                 ‘template<class _Tp> const _Tp& std::max(const _Tp&, const _Tp&)’
  257 |     max(const _Tp& __a, const _Tp& __b)
      |     ^~~
maxandap.cpp:3:7: note:                 ‘int max’
    3 | int n,max,ap,x;
      |       ^~~
maxandap.cpp:13:13: error: reference to ‘max’ is ambiguous
   13 |             max= x;
      |             ^~~
/usr/include/c++/13/bits/stl_algobase.h:303:5: note: candidates are: ‘template<class _Tp, class _Compare> const _Tp& std::max(const _Tp&, const _Tp&, _Compare)’
  303 |     max(const _Tp& __a, const _Tp& __b, _Compare __comp)
      |     ^~~
/usr/include/c++/13/bits/stl_algobase.h:257:5: note:                 ‘template<class _Tp> const _Tp& std::max(const _Tp&, const _Tp&)’
  257 |     max(const _Tp& __a, const _Tp& __b)
      |     ^~~
maxandap.cpp:3:7: note:                 ‘int max’
    3 | int n,max,ap,x;
      |       ^~~
maxandap.cpp:15:25: error: ‘maxim’ was not declared in this scope; did you mean ‘max’?
   15 |         } else if (x == maxim)
      |                         ^~~~~
      |                         max
maxandap.cpp:20:13: error: reference to ‘max’ is ambiguous
   20 |     cout << max<< " " << ap;
      |             ^~~
/usr/include/c++/13/bits/stl_algobase.h:303:5: note: candidates are: ‘template<class _Tp, class _Compare> const _Tp& std::max(const _Tp&, const _Tp&, _Compare)’
  303 |     max(const _Tp& __a, const _Tp& __b, _Compare __comp)
      |     ^~~
/usr/include/c++/13/bits/stl_algobase.h:257:5: note:                 ‘template<class _Tp> const _Tp& std::max(const _Tp&, const _Tp&)’
  257 |     max(const _Tp& __a, const _Tp& __b)
      |     ^~~
maxandap.cpp:3:7: note:                 ‘int max’
    3 | int n,max,ap,x;
      |       ^~~

Cum funcționează evaluarea?