1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
#include <iostream>
#include <map>
#include <vector>
#include <stack>
using namespace std;
class node
{
public:
    int degree;
    vector<int>near;
    node()
    {
        degree=0;
    }
};
int main()
{
    int n,m;
    cin>>n>>m;
    vector<node>grouph;
    grouph.resize(n);
    for(int i=0;i<m;i++)
    {
        int a,b;
        cin>>a>>b;
        a--;
        b--;
        grouph[a].degree++;
        grouph[b].degree++;
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX