Rezumat problemă

ff

#4304

Se dă un graf neorientat. Să se determine un subgraf al său, cu număr cât mai mare de noduri și în care fiecare nod are gradul cel puțin 2.

CPPI Craiova - Concurs de antrenament 4-5 ianuarie 2023

Fișiere Marius Nicoli (mariusn) Nicoli Marius ușoară

Clasa 11 Teoria Grafurilor Parcurgerea grafurilor neorientate

Rezolvă

Detalii

Problema	ff	Operații I/O	ff.in/ff.out
Limita timp	0.3 secunde	Limita memorie	Total: 64 MB / Stivă 8 MB
Id soluție	#58363803	Utilizator	Sabou Mihai (MareleAlbastru)
Fișier	ff.cpp	Dimensiune	880 B
Data încărcării	29 Mai 2025, 13:16	Scor/rezultat	Eroare de compilare

Evaluare

Mesaj compilare

ff.cpp: In function 'int main()':
ff.cpp:38:9: error: redeclaration of 'int m'
     int m = -1;

         ^
ff.cpp:20:12: error: 'int m' previously declared here
     int n, m = 0, x, y;

            ^
ff.cpp:43:33: error: no matching function for call to 'max(int&, std::set<int>::size_type)'
             m = max(m, v2.size());

                                 ^
ff.cpp:43:33: 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/istream:38,
                 from /usr/include/c++/4.8/sstream:38,
                 from /usr/include/c++/4.8/complex:45,
                 from /usr/include/c++/4.8/ccomplex:38,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:52,
                 from ff.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:
ff.cpp:43:33: note:   deduced conflicting types for parameter 'const _Tp' ('int' and 'std::set<int>::size_type {aka unsigned int}')
             m = max(m, v2.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/istream:38,
                 from /usr/include/c++/4.8/sstream:38,
                 from /usr/include/c++/4.8/complex:45,
                 from /usr/include/c++/4.8/ccomplex:38,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:52,
                 from ff.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:
ff.cpp:43:33: note:   deduced conflicting types for parameter 'const _Tp' ('int' and 'std::set<int>::size_type {aka unsigned int}')
             m = max(m, v2.size());

                                 ^
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64,
                 from ff.cpp:1:
/usr/include/c++/4.8/bits/stl_algo.h:4231:5: note: template<class _Tp> _Tp std::max(std::initializer_list<_Tp>)
     max(initializer_list<_Tp> __l)
     ^
/usr/include/c++/4.8/bits/stl_algo.h:4231:5: note:   template argument deduction/substitution failed:
ff.cpp:43:33: note:   mismatched types 'std::initializer_list<_Tp>' and 'int'
             m = max(m, v2.size());

                                 ^
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64,
                 from ff.cpp:1:
/usr/include/c++/4.8/bits/stl_algo.h:4236:5: note: template<class _Tp, class _Compare> _Tp std::max(std::initializer_list<_Tp>, _Compare)
     max(initializer_list<_Tp> __l, _Compare __comp)
     ^
/usr/include/c++/4.8/bits/stl_algo.h:4236:5: note:   template argument deduction/substitution failed:
ff.cpp:43:33: note:   mismatched types 'std::initializer_list<_Tp>' and 'int'
             m = max(m, v2.size());

                                 ^

Cum funcționează evaluarea?