#1444
Memory001
Să se afle indicele coloanei dintr-o matrice pentru care suma elementelor este minimă.
folclor
Problema | Memory001 | Operații I/O |
memory001.in /memory001.out
|
---|---|---|---|
Limita timp | 0.3 secunde | Limita memorie |
Total: 0.1 MB
/
Stivă 0 MB
|
Id soluție | #50717330 | Utilizator | |
Fișier | memory001.cpp | Dimensiune | 464 B |
Data încărcării | 24 Aprilie 2024, 15:29 | Scor / rezultat | Eroare de compilare |
memory001.cpp:6:38: error: too many decimal points in number unsigned long long int a,v[1001],min=2.000.000.000,s; ^ memory001.cpp: In function 'int main()': memory001.cpp:16:2: error: reference to 'min' is ambiguous min=v[1]; ^ memory001.cpp:6:34: note: candidates are: long long unsigned int min unsigned long long int a,v[1001],min=2.000.000.000,s; ^ 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/istream:38, from /usr/include/c++/4.8/fstream:38, from memory001.cpp:1: /usr/include/c++/4.8/bits/stl_algobase.h:239:5: note: template<class _Tp, class _Compare> const _Tp& std::min(const _Tp&, const _Tp&, _Compare) min(const _Tp& __a, const _Tp& __b, _Compare __comp) ^ /usr/include/c++/4.8/bits/stl_algobase.h:193:5: note: template<class _Tp> const _Tp& std::min(const _Tp&, const _Tp&) min(const _Tp& __a, const _Tp& __b) ^ memory001.cpp:19:17: error: reference to 'min' is ambiguous if(v[j]<min) ^ memory001.cpp:6:34: note: candidates are: long long unsigned int min unsigned long long int a,v[1001],min=2.000.000.000,s; ^ 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/istream:38, from /usr/include/c++/4.8/fstream:38, from memory001.cpp:1: /usr/include/c++/4.8/bits/stl_algobase.h:239:5: note: template<class _Tp, class _Compare> const _Tp& std::min(const _Tp&, const _Tp&, _Compare) min(const _Tp& __a, const _Tp& __b, _Compare __comp) ^ /usr/include/c++/4.8/bits/stl_algobase.h:193:5: note: template<class _Tp> const _Tp& std::min(const _Tp&, const _Tp&) min(const _Tp& __a, const _Tp& __b) ^ memory001.cpp:21:13: error: reference to 'min' is ambiguous min=v[j]; ^ memory001.cpp:6:34: note: candidates are: long long unsigned int min unsigned long long int a,v[1001],min=2.000.000.000,s; ^ 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/istream:38, from /usr/include/c++/4.8/fstream:38, from memory001.cpp:1: /usr/include/c++/4.8/bits/stl_algobase.h:239:5: note: template<class _Tp, class _Compare> const _Tp& std::min(const _Tp&, const _Tp&, _Compare) min(const _Tp& __a, const _Tp& __b, _Compare __comp) ^ /usr/include/c++/4.8/bits/stl_algobase.h:193:5: note: template<class _Tp> const _Tp& std::min(const _Tp&, const _Tp&) min(const _Tp& __a, const _Tp& __b) ^
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema Memory001 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ă.