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 01level, 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 <iostream>
#include <vector>
#include <string.h>
using namespace std;
vector<vector<int> >q;//定义向量q来存放各节点的左右孩子
int deep=-1;//初始化深度
int a[101];
void dfs(int x,int y){//进行深度优先搜索遍历
	if(q[x].size()==0){//该点为叶子节点，数目加1，深度为y与之前深度比较，取最大值
		a[y]++;
		deep=max(deep,y);
		return;
	}
	for(int i=0;i<(int)q[x].size();i++){//不为叶子节点，递归
		dfs(q[x][i],y+1);
	}
}
int main() {
	int n,m,m1,x,y;
	while(cin>>n>>m){
		q.resize(101);//定义q的大小为101
		memset(a,0,sizeof(a));//初始化数组a
		while(m--){
			cin>>x>>m1;//输入非叶子结点的ID与孩子个数
			while(m1--){
				cin>>y;
				q[x].push_back(y);//将孩子结点ID放入向量q中
			}
		}
		dfs(1,0);//从根结点开始遍历
		for(int i=0;i<=deep;i++){//深度从0到最大输出叶子结点
			if(i==0)
				cout<<a[i];
			else
				cout<<" "<<a[i];
		}
		cout<<endl;
	}
	return 0;
}