#417
GradMax
Se dă lista muchiilor unui graf neorientat. Să se afișeze vârfurile de grad maxim.
Problema | GradMax | Operații I/O |
![]() gradmax.in /gradmax.out
|
---|---|---|---|
Limita timp | 0.1 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
Id soluție | #51562833 | Utilizator | |
Fișier | gradmax.cpp | Dimensiune | 775 B |
Data încărcării | 11 Iulie 2024, 18:57 | Scor / rezultat | Eroare de compilare |
gradmax.cpp: In function 'int main()': gradmax.cpp:33:44: error: no matching function for call to 'max(int&, std::set<int>::size_type)' maxGrad=max(maxGrad,Graph[i].size()); ^ gradmax.cpp:33:44: note: candidates are: 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 gradmax.cpp:1: /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) ^ /usr/include/c++/4.8/bits/stl_algobase.h:216:5: note: template argument deduction/substitution failed: gradmax.cpp:33:44: note: deduced conflicting types for parameter 'const _Tp' ('int' and 'std::set<int>::size_type {aka unsigned int}') maxGrad=max(maxGrad,Graph[i].size()); ^ 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 gradmax.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:260:5: note: template argument deduction/substitution failed: gradmax.cpp:33:44: note: deduced conflicting types for parameter 'const _Tp' ('int' and 'std::set<int>::size_type {aka unsigned int}') maxGrad=max(maxGrad,Graph[i].size()); ^ gradmax.cpp:38:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] if (Graph[i].size()==maxGrad) ^
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema GradMax 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ă.