代码：#include<cstdio>#include<cstring>using namespace std;int n,k;int father[105],son[105];int dd;void Find(int a){//int r=son[a];while(father[a]!=a){a=father[a];son[a]+=(dd);//r=son[a];}//father[r]=a;//return a;}void Union(int a,int b){father[b]=a;son[a]+=(son[b]+1);dd=son[b]+1;Find(a);}int main(){while(scanf("%d%d",&n,&k)==2){for(int i=1; i<=n; i++){father[i]=i;son[i]=0;}for(int i=1; i<n; i++){int a,b;scanf("%d%d",&a,&b);Union(a,b);}int ans=0;for(int i=1; i<=n; i++){//printf("%d %d\n",i,son[i]);if(son[i]==k)ans++;}printf("%d\n",ans);}return 0;}
版权声明：本文为博主原创文章，，未经博主允许不得转载。
真凉爽啊！青山绿水映入我的眼中，景色怡人啊！
