#220
ProdMax
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
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 | #58460895 | Utilizator | |
Fișier | prodmax.cpp | Dimensiune | 773 B |
Data încărcării | 06 Iunie 2025, 18:46 | Scor / rezultat | Eroare de compilare |
prodmax.cpp: In function 'int main()': prodmax.cpp:21:26: error: reference to 'max' is ambiguous if(ok==1 && nr > max) max = nr; ^ prodmax.cpp:5:27: note: candidates are: int max int a[105][105],m,n,k,i,j,max=-99999999, ok, nr; ^ In file included from /usr/include/c++/4.8/bits/char_traits.h:39:0, from /usr/include/c++/4.8/ios:40, from /usr/include/c++/4.8/ostream:38, from /usr/include/c++/4.8/iostream:39, from prodmax.cpp:1: /usr/include/c++/4.8/bits/stl_algobase.h:260:5: note: template<class _Tp, class _Compare> const _Tp& std::max(const _Tp&, const _Tp&, _Compare) max(const _Tp& __a, const _Tp& __b, _Compare __comp) ^ /usr/include/c++/4.8/bits/stl_algobase.h:216:5: note: template<class _Tp> const _Tp& std::max(const _Tp&, const _Tp&) max(const _Tp& __a, const _Tp& __b) ^ prodmax.cpp:21:31: error: reference to 'max' is ambiguous if(ok==1 && nr > max) max = nr; ^ prodmax.cpp:5:27: note: candidates are: int max int a[105][105],m,n,k,i,j,max=-99999999, ok, nr; ^ In file included from /usr/include/c++/4.8/bits/char_traits.h:39:0, from /usr/include/c++/4.8/ios:40, from /usr/include/c++/4.8/ostream:38, from /usr/include/c++/4.8/iostream:39, from prodmax.cpp:1: /usr/include/c++/4.8/bits/stl_algobase.h:260:5: note: template<class _Tp, class _Compare> const _Tp& std::max(const _Tp&, const _Tp&, _Compare) max(const _Tp& __a, const _Tp& __b, _Compare __comp) ^ /usr/include/c++/4.8/bits/stl_algobase.h:216:5: note: template<class _Tp> const _Tp& std::max(const _Tp&, const _Tp&) max(const _Tp& __a, const _Tp& __b) ^ prodmax.cpp:31:27: error: reference to 'max' is ambiguous if(ok==1 && nr == max) fout<<j<<" "; ^ prodmax.cpp:5:27: note: candidates are: int max int a[105][105],m,n,k,i,j,max=-99999999, ok, nr; ^ In file included from /usr/include/c++/4.8/bits/char_traits.h:39:0, from /usr/include/c++/4.8/ios:40, from /usr/include/c++/4.8/ostream:38, from /usr/include/c++/4.8/iostream:39, from prodmax.cpp:1: /usr/include/c++/4.8/bits/stl_algobase.h:260:5: note: template<class _Tp, class _Compare> const _Tp& std::max(const _Tp&, const _Tp&, _Compare) max(const _Tp& __a, const _Tp& __b, _Compare __comp) ^ /usr/include/c++/4.8/bits/stl_algobase.h:216:5: note: template<class _Tp> const _Tp& std::max(const _Tp&, const _Tp&) max(const _Tp& __a, const _Tp& __b) ^
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema ProdMax face parte din prima categorie. Soluția propusă de tine va fi evaluată astfel:
Suma punctajelor acordate pe testele utilizate pentru verificare este 100. Astfel, soluția ta poate obține cel mult 100 de puncte, caz în care se poate considera corectă.