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<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<vector>
using namespace std;
int t,n,s,ff;
int nn[100010];
vector<int> v[100010];
int dfs(int k,int f)
{
    int d,i,s=0,r=0;
    if(f!=-1&&v[k].size()==1)
    { 
        d=nn[k];
        if(nn[k]!=0)
        {
            nn[k]--;
            ff=1;
        }
        return d!=0;
    }
    for(i=0;i<v[k].size();i++)
    {
        if(v[k][i]==f) continue;
        s+=dfs(v[k][i],k);
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX