hdu 5326（floyd递推人际关系）

转载地址：http://blog.csdn.net/mengxiang000000/article/details/50570864

代码：

#include<stdio.h>#include<string.h>using namespace std;int maps[105][105];int main(){    int n,k;    while(~scanf("%d%d",&n,&k))    {        memset(maps,0,sizeof(maps));        for(int i=0; i<n-1; i++)        {            int x,y;            scanf("%d%d",&x,&y);            maps[x][y]=1;        }        for(int k=1;k<=n;k++)        {            for(int i=1;i<=n;i++)            {                for(int j=1;j<=n;j++)                {                    if(maps[i][k]==1&&maps[k][j]==1)                        maps[i][j]=1;                }            }        }        int ans=0;        for(int i=1;i<=n;i++)        {            int temp=0;            for(int j=1;j<=n;j++)            {                if(i!=j&&maps[i][j]==1)                    temp++;            }            //printf("%d\n",temp);            if(temp==k)                ans++;        }        printf("%d\n",ans);    }}

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 21 21 32 42 53 63 7 

 

Sample Output

2