PAT 甲级 1004 Counting Leaves

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

解题思路:第一行输入结点数及非叶子结点数，之后每行给出非叶子结点的孩子信息。要求输出每一层的叶子结点数。用DFS遍历然后数组存储每一层的叶子结点数，因为输出最后没有空格需要记录树的最大层数。

代码：

#include<cstdio>
#include<vector>
using namespace std;
int N,M;
int level[110] = {0};
int maxlevel = 0;
vector<int> node[110];
void DFS(int root,int layer){
	if(node[root].size() == 0){
		if(layer > maxlevel)
			maxlevel = layer;
		level[layer]++;
	}
	for(int i = 0;i < node[root].size();i++){
		DFS(node[root][i],layer+1);
	}
}
int main(void)
{
	scanf("%d %d",&N,&M)	;
	for(int i = 0;i < M;i++){
		int pos,ch,num;
		scanf("%d %d",&pos,&num);
		for(int j = 0;j < num;j++){
			scanf("%d",&ch);
			node[pos].push_back(ch);
		}
	}
	DFS(1,0);
	printf("%d",level[0]);
	for(int i = 1;i <= maxlevel;i++){
		printf(" %d",level[i]);
	}
	return 0;
}