Codeforces Round #506 (Div. 3) E

Codeforces Round #506 (Div. 3) E

dfs+贪心

#include<bits/stdc++.h>

using namespace std;
typedef long long ll;
const int maxn = ;
int n,u,v;
int ans;
vector<int>M[maxn];
int dfs(int cur,int pre)
{
    int ret = ;
    for(int i=;i<M[cur].size();i++)
    {
        int nex = M[cur][i];
        if(pre == nex)continue;
        ret = min(ret,dfs(nex,cur));
    }
    if(ret ==  && cur !=  && pre != )ans++;
    return (ret+)%;
}
int main()
{
    scanf("%d",&n);
    for(int i=;i<n;i++){
        scanf("%d%d",&u,&v);
        M[u].push_back(v);
        M[v].push_back(u);
    }
    dfs(,);
    cout<<ans<<endl;
}