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<cstdio>
#include<algorithm>
#include<vector>
using namespace std;
vector<int> node[100005];
int num[100005];
int dfs(int u,int v)
{
    num[u]=1;
    for(int i=0;i<node[u].size();i++)
    {
        int tmp=node[u][i];
        if(tmp==v) continue;
        num[u]+=dfs(tmp,u);
    }
    return num[u];
}
int main()
{
    int n,i,ans=0,x,y;
    scanf("%d",&n);
    for(i=1;i<n;i++)
    {
        scanf("%d%d",&x,&y);
        node[x].push_back(y);
        node[y].push_back(x);
    }
    dfs(1,-1);
    for(i=1;i<=n;i++)
        if(num[i]%2==0) ans++;
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX