简单并查集，记录每个点有几个节点“杭电多校联赛签到题”

Problem Description

It’s an interesting experience to move from ICPC to work, end my college life and start a brand new journey in company.
As is known to all, every stuff in a company has a title, everyone except the boss has a direct leader, and all the relationship forms a tree. If A’s title is higher than B(A is the direct or indirect leader of B), we call it A manages B.
Now, give you the relation of a company, can you calculate how many people manage k people. 

 

Input

There are multiple test cases.
Each test case begins with two integers n and k, n indicates the number of stuff of the company.
Each of the following n-1 lines has two integers A and B, means A is the direct leader of B.

1 <= n <= 100 , 0 <= k < n
1 <= A, B <= n

 

Output

For each test case, output the answer as described above.

 

Sample Input

  
  

   
   7 2
1 2
1 3
2 4
2 5
3 6
3 7
  
  

 

Sample Output

  
  

   
   2
  
  





思路：并查集，并不直接合并节点，而是在找的时候给经过的节点+1；
代码：
#include<stdio.h>

int f[105];
int sum[105];
int main()
{
    int n,m,i;
    while(scanf("%d%d",&n,&m)!=EOF)
    {
        for(i=1; i<=n; i++)
        {
            f[i]=i;
            sum[i]=0;
        }
        for(i=1; i<n; i++)
        {int a,b;
            scanf("%d%d",&a,&b);
            f[b]=a;
        }
        for(i=1;i<=n;i++)
        {int x=i;
            while(x!=f[x])
            {
                sum[f[x]]++;
                x=f[x];
            }
        }
        int sb=0;
        for(i=1;i<=n;i++)
          if(sum[i]==m)
            sb++;
            printf("%d\n",sb);

    }
}