@[八爷](/user/834518) 应该 dfs(v,u) 呀
by lcbridge @ 2024-02-23 20:37:52
```cpp
#include<bits/stdc++.h>
using namespace std;
vector<int>a[100001];
int f[100001];
int sum;
int n,d;
int dfs(int p,int o){
if(f[p]==1){
return sum;
}
if(o==d){
return sum;
}
f[p]=1;
for(int i=0;i<a[p].size();i++){
if(f[a[p][i]]==0){
dfs(a[p][i],o+1);
sum++;
}
}
return sum;
}
int main(){
cin>>n>>d;
for(int i=2;i<=n;i++){
int x,y;
cin>>x>>y;
a[x].push_back(y);
a[y].push_back(x);
}
cout<<dfs(1,0);
return 0;
}
```
by Wzl111 @ 2024-03-28 23:01:48