杭电-5326 Work

Work

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 1697    Accepted Submission(s): 1015

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
  
  

 

Author

ZSTU

Source

2015 Multi-University Training Contest 3

Recommend

wange2014   |   We have carefully selected several similar problems for you:   5780  5779  5778  5777  5776 

AC代码：

#include<stdio.h>
#include<string.h>
using namespace std;
int set[105];
int num[105];
void find(int a)
{
    while(set[a]!=a)
    {
        a=set[a];   //r是一个上司。
        num[a]++;  //这个上司有一个员工。
    }
}
int main()
{
    int n,m;
    while(~scanf("%d%d",&n,&m))
    {
        for(int i=1;i<=n;i++)
        {
            set[i]=i;
            num[i]=0;
        }
        for(int i=0;i<n-1;i++)
        {
            int x,y;
            scanf("%d%d",&x,&y);
            set[y]=x;//让并查集数组指向上司
        }
        int output=0;
        for(int i=1;i<=n;i++)
        {
            find(i);//枚举每一个人，让他找他的上司
        }
        for(int i=1;i<=n;i++)
        {
            if(num[i]==m)
            output++;//符合条件的输出
        }
        printf("%d\n",output);
    }
    return 0;
}