hd 5236 Work

Work

                                                                        Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
                                                                                        Total Submission(s): 1696    Accepted Submission(s): 1014

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
  
  
  
  

   
   
#include<cstdio>
#include<iostream>
using namespace std;
int pre[110];
int num[110];
void find(int x)
{
    while(pre[x] != x)
    {
        x = pre[x];
        num[x]++;
    }
}
int main()
{
    int n ,m;
    while(cin >> n >> m)
    {
        for(int i = 1 ; i <= n ; i++)
        {
            pre[i] = i;
            num[i] = 0;
        }
        for(int i = 0 ; i < n - 1 ; i++)
        {
            int a,b;
            cin >> a >> b;
            pre[b] = a;  //直接用并查集数组指向上司
        }
        int ans = 0;
        for(int i = 1 ; i <= n ; i++)
            find(i);  
        for(int i = 1 ; i <= n ; i++)
        {
            if(num[i] == m)
                ans++;
        }
        cout << ans <<endl;
    }
    return 0;
}