1004 Counting Leaves (30分)

题目链接：https://pintia.cn/problem-sets/994805342720868352/problems/994805521431773184

题目：

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<cstdio>
#include<algorithm>
using namespace std;

#define MAXNode 100
#define INF 1000000000
struct Node 
{
	bool child;	//	是否有孩子 
	int father;
	int level;
};

int main()
{
	int n,m;	//	树的总节点数、树中的非叶子节点总数 
	int MaxLevel = 1, ID, k, child;
	
	scanf("%d%d", &n, &m);
	if(n <= 0 || n>100) return 0;
	
	Node nodes[MAXNode];
	for(int i=0; i<MAXNode; i++)
	{
		nodes[i].child = false;		//	初始化为无孩子 
		nodes[i].level = -1;
		nodes[i].father = -1;
	}
	
	nodes[1].level = 1;
	
	for(int i=0; i<m; i++)
	{
		scanf("%d%d", &ID, &k);
		if(k!=0) 
		{
			nodes[ID].child = true;	//该节点有孩子 
		}
		for(int j=1; j<=k; j++)
		{
			scanf("%d", &child);
			nodes[child].father = ID;
		}
	} 
		
	for(int i=2; i<=n; i++)
	{
		int pre = nodes[i].father;	//	祖先 
		nodes[i].level = nodes[pre].level+1;
		if(nodes[i].level > MaxLevel)	MaxLevel = nodes[i].level;	
	}
	
	int output[MAXNode];
	fill(output, output+MAXNode, 0);
	for(int i=1; i<=n; i++)
	{
		if(nodes[i].child == false)
			output[nodes[i].level]++;
	}
	
	for(int i=1;i<=MaxLevel-1; i++)
		printf("%d ", output[i]);
	printf("%d", output[MaxLevel]);
	return 0;
}