J HDU 5326 Work

Work

Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u

Submit  Status  Practice  HDU 5326

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<stdio.h>
#include<string.h>
using namespace std;
int pre[110],num[110];
int find(int p)
{
	while(p!=pre[p])
	{
		num[pre[p]]++;
		p=pre[p];
	}
}
int main()
{
	int n,k;
	int x,y;
	while(~scanf("%d%d",&n,&k))
	{
		memset(num,0,sizeof(num));
		for(int i=1;i<=n;i++)
		pre[i]=i;
		for(int i=0;i<n-1;i++)
		{
			scanf("%d%d",&x,&y);
			pre[y]=x;
		}
		for(int i=1;i<=n;i++)
		{
			find(i);
		}
		int cnt=0;
		for(int i=1;i<=n;i++)
		{
			if(num[i]==k)
			cnt++;
		}
		printf("%d\n",cnt);
	}
}