hdoj5326

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<stdio.h>
#include<string.h>
int num[110];
int par[110];
int find(int x)
{
	while(x!=par[x])//此题不能路径压缩 
	{
		num[par[x]]++;
		x=par[x];
	}
}
int main()
{
	int n,k,a,b,i;
	while(scanf("%d%d",&n,&k)!=EOF)
	{
		memset(num,0,sizeof(num));
		for(i=1;i<=100;i++)
		par[i]=i;
		for(i=0;i<n-1;i++)
		{
			scanf("%d%d",&a,&b);//a管理b. 
			par[b]=a;
		}
		for(i=1;i<=n;i++)
		{
			find(i);
		}
		int sum=0;
		for(i=1;i<=n;i++)
		{
			if(num[i]==k)
			sum++;
		}
		printf("%d\n",sum);
	}
}