Rezumat problemă

GradMax

#417

Se dă lista muchiilor unui graf neorientat. Să se afișeze vârfurile de grad maxim.

Fișiere Candale Silviu (silviu) ușoară

Clasa 11 Teoria Grafurilor Probleme elementare cu grafuri neorientate

Rezolvă

Detalii

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	#64707713	Utilizator	Cret Cristian (Cret_Cristian)
Fișier	gradmax.cpp	Dimensiune	457 B
Data încărcării	25 Mai 2026, 11:42	Scor/rezultat	Eroare de compilare

Evaluare

Mesaj compilare

gradmax.cpp: In function ‘int main()’:
gradmax.cpp:23:17: error: no matching function for call to ‘max(int&, std::set<int>::size_type)’
   23 |         mx = max(mx, v[i].size());
      |              ~~~^~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/algorithm:60,
                 from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:51,
                 from gradmax.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:
gradmax.cpp:23:17: note:   deduced conflicting types for parameter ‘const _Tp’ (‘int’ and ‘std::set<int>::size_type’ {aka ‘long unsigned int’})
   23 |         mx = max(mx, v[i].size());
      |              ~~~^~~~~~~~~~~~~~~~~
/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:
gradmax.cpp:23:17: note:   deduced conflicting types for parameter ‘const _Tp’ (‘int’ and ‘std::set<int>::size_type’ {aka ‘long unsigned int’})
   23 |         mx = max(mx, v[i].size());
      |              ~~~^~~~~~~~~~~~~~~~~
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:
gradmax.cpp:23:17: note:   mismatched types ‘std::initializer_list<_Tp>’ and ‘int’
   23 |         mx = max(mx, v[i].size());
      |              ~~~^~~~~~~~~~~~~~~~~
/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:
gradmax.cpp:23:17: note:   mismatched types ‘std::initializer_list<_Tp>’ and ‘int’
   23 |         mx = max(mx, v[i].size());
      |              ~~~^~~~~~~~~~~~~~~~~
gradmax.cpp:26:24: warning: comparison of integer expressions of different signedness: ‘std::set<int>::size_type’ {aka ‘long unsigned int’} and ‘int’ [-Wsign-compare]
   26 |         if(v[i].size() == mx)
      |            ~~~~~~~~~~~~^~~~~

Cum funcționează evaluarea?