Rezumat problemă

ProdMax

#220

Se dă o matrice cu elemente numere naturale, care conţine doar valorile {0,1,2}. Să se determine numerele de ordine ale coloanelor pentru care produsul elementelor este maxim.

Variante Bacalaureat 2009

Fișiere Candale Silviu (silviu) medie

Clasa 9 Tablouri bidimensionale (matrice) Parcurgerea matricelor oarecare Bacalaureat Bacalaureat 2009

Rezolvă

Detalii

Problema	ProdMax	Operații I/O	prodmax.in/prodmax.out
Limita timp	0.1 secunde	Limita memorie	Total: 64 MB / Stivă 8 MB
Id soluție	#64890060	Utilizator	Mihali Andrei (sebi250)
Fișier	prodmax.cpp	Dimensiune	701 B
Data încărcării	09 Iunie 2026, 20:29	Scor/rezultat	Eroare de compilare

Evaluare

Mesaj compilare

prodmax.cpp: In function ‘int main()’:
prodmax.cpp:30:15: error: no matching function for call to ‘max(int&, long long int&)’
   30 |         ma=max(ma,mat[0][i]);
      |            ~~~^~~~~~~~~~~~~~
In file included from /usr/include/c++/13/algorithm:60,
                 from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:51,
                 from prodmax.cpp:1:
/usr/include/c++/13/bits/stl_algobase.h:257:5: note: candidate: ‘template<class _Tp> const _Tp& std::max(const _Tp&, const _Tp&)’
  257 |     max(const _Tp& __a, const _Tp& __b)
      |     ^~~
/usr/include/c++/13/bits/stl_algobase.h:257:5: note:   template argument deduction/substitution failed:
prodmax.cpp:30:15: note:   deduced conflicting types for parameter ‘const _Tp’ (‘int’ and ‘long long int’)
   30 |         ma=max(ma,mat[0][i]);
      |            ~~~^~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algobase.h:303:5: note: candidate: ‘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:303:5: note:   template argument deduction/substitution failed:
prodmax.cpp:30:15: note:   deduced conflicting types for parameter ‘const _Tp’ (‘int’ and ‘long long int’)
   30 |         ma=max(ma,mat[0][i]);
      |            ~~~^~~~~~~~~~~~~~
In file included from /usr/include/c++/13/algorithm:61:
/usr/include/c++/13/bits/stl_algo.h:5795:5: note: candidate: ‘template<class _Tp> _Tp std::max(initializer_list<_Tp>)’
 5795 |     max(initializer_list<_Tp> __l)
      |     ^~~
/usr/include/c++/13/bits/stl_algo.h:5795:5: note:   template argument deduction/substitution failed:
prodmax.cpp:30:15: note:   mismatched types ‘std::initializer_list<_Tp>’ and ‘int’
   30 |         ma=max(ma,mat[0][i]);
      |            ~~~^~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:5805:5: note: candidate: ‘template<class _Tp, class _Compare> _Tp std::max(initializer_list<_Tp>, _Compare)’
 5805 |     max(initializer_list<_Tp> __l, _Compare __comp)
      |     ^~~
/usr/include/c++/13/bits/stl_algo.h:5805:5: note:   template argument deduction/substitution failed:
prodmax.cpp:30:15: note:   mismatched types ‘std::initializer_list<_Tp>’ and ‘int’
   30 |         ma=max(ma,mat[0][i]);
      |            ~~~^~~~~~~~~~~~~~
prodmax.cpp:9:15: warning: unused variable ‘k’ [-Wunused-variable]
    9 |     long long k,n,m,mat[105][105]= {1},v[30];
      |               ^
prodmax.cpp:9:40: warning: unused variable ‘v’ [-Wunused-variable]
    9 |     long long k,n,m,mat[105][105]= {1},v[30];
      |                                        ^

Cum funcționează evaluarea?