#3263
SumMax_XI
Se dă o matrice pătratică cu n
lini şi n
coloane şi elemente numere întregi. Determinaţi cea mai mare sumă a n
elemente din matrice, adunând câte un element de pe fiecare linie a matricei.
Problema | SumMax_XI | Operații I/O |
summax_xi.in /summax_xi.out
|
---|---|---|---|
Limita timp | 0.75 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
Id soluție | #28805152 | Utilizator | |
Fișier | summax_xi.cpp | Dimensiune | 459 B |
Data încărcării | 18 Martie 2021, 18:50 | Scor / rezultat | Eroare de compilare |
summax_xi.cpp: In function 'int main()': summax_xi.cpp:17:20: error: reference to 'max' is ambiguous if(a[j][i]>max){max=a[j][i]; ^ summax_xi.cpp:6:23: note: candidates are: int max int a[101][101],n,i,j,max=-999999; ^ 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 summax_xi.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) ^ summax_xi.cpp:17:25: error: reference to 'max' is ambiguous if(a[j][i]>max){max=a[j][i]; ^ summax_xi.cpp:6:23: note: candidates are: int max int a[101][101],n,i,j,max=-999999; ^ 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 summax_xi.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) ^ summax_xi.cpp:20:30: error: reference to 'max' is ambiguous sum+=max;} ^ summax_xi.cpp:6:23: note: candidates are: int max int a[101][101],n,i,j,max=-999999; ^ 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 summax_xi.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 SumMax_XI 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ă.