1004 Counting Leaves (30 分)
A family hierarchy is usually presented by a pedigree tree. Your job is to count those family members who have no child.
Input Specification:
Each input file contains one test case. Each case starts with a line containing 0<N<100, the number of nodes in a tree, and M (<N), the number of non-leaf nodes. Then M lines follow, each in the format:
ID K ID[1] ID[2] ... ID[K]
where ID
is a two-digit number representing a given non-leaf node, K
is the number of its children, followed by a sequence of two-digit ID
's of its children. For the sake of simplicity, let us fix the root ID to be 01
.
The input ends with N being 0. That case must NOT be processed.
Output Specification:
For each test case, you are supposed to count those family members who have no child for every seniority level starting from the root. The numbers must be printed in a line, separated by a space, and there must be no extra space at the end of each line.
The sample case represents a tree with only 2 nodes, where 01
is the root and 02
is its only child. Hence on the root 01
level, there is 0
leaf node; and on the next level, there is 1
leaf node. Then we should output 0 1
in a line.
Sample Input:
2 1
01 1 02
Sample Output:
0 1
思路:
输出每一层叶子的数目
最多100个节点,直接建一个100x100的数组,记录每个非空节点的孩子,最后用深搜(广搜其实更好)从根结点开始向下遍历一遍就好了
#include<iostream>
#include<algorithm>
#include<string.h>
using namespace std;
int lev[105],an[105][105],deepth,n,m;
void dfs(int node[],int cur)
{
if(!node[0]) //没有子节点就返回
{
lev[cur]++;
deepth=max(deepth,cur);
return ;
}
for(int i=1;i<=node[0];i++)
{
dfs(an[node[i]],cur+1);
}
}
int main()
{
scanf("%d",&n);
scanf("%d",&m);
deepth=0;
memset(an,0,sizeof(an));
memset(lev,0,sizeof(lev));
for(int i=0;i<m;i++)
{
int id,k;
scanf("%d%d",&id,&k);
an[id][0]=k; //记录孩子的个数
for(int j=1;j<=k;j++)
{
int subid;
scanf("%d",&subid);
an[id][j]=subid;
}
}
dfs(an[1],0);
for(int i=0;i<=deepth;i++)
{
printf("%d",lev[i]);
if(i==deepth)
break;
printf(" ");
}
return 0;
}