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
代码如下:
#include<stdio.h>
#define MAXLEN 105
int n,m;
int father[MAXLEN];///mark father node of every child node
int leaf[MAXLEN];///the leaf number of every level
int level;///the level of pidigree tree
/**
judge if node have child,if have return 1,or return 0
*/
int judge_child(int node){
int i;
for(i=2;i<=n;i++){
if(father[i]==node){
return 1;
}
}
return 0;
}
/**
count which level the node belongs to,then return the level of node
*/
int count_level(int node) {
int l=2;
int id=father[node];///the father node of this node
while(id!=1){
l++;
id=father[id];
}
return l;
}
/**
count the number of leaf of every level
*/
void count_leaf(){
int i;
///init of leaf number of every level ,suppose the number of level is n
for(i=1;i<=n;i++){
leaf[i]=0;
}
///count leaf number
for(i=2;i<=n;i++){
int l=count_level(i);
if(judge_child(i)==0){
leaf[l]++;
}
if(l>level){
level=l;
}
///printf("%d\n",l);
}
}
int main(){
scanf("%d %d",&n,&m);
/**
test point 2 :
If m==0,means every node is the root node
*/
if(m==0){
printf("1");
return 0;
}
int i,j,k,id_r,id_c;
father[1]=1;
for(i=0;i<m;i++){
scanf("%d %d",&id_r,&k);
for(j=0;j<k;j++){
scanf("%d",&id_c);
father[id_c]=id_r;
}
}
///for(i=1;i<=n;i++)
///printf("%d ",father[i]);
///for(i=2;i<=n;i++)
///printf("%d\n",count_level(i));
level=1;///init of level
count_leaf();
for(i=1;i<=level;i++){
if(i==1){
printf("%d",leaf[i]);
}else{
printf(" %d",leaf[i]);
}
}
return 0;
}
/**
test case 1:
7 3
1 2 2 3
2 2 4 5
3 2 6 7
test case 2:
1 0
*/
结果如下: