A family hierarchy is usually presented by a pedigree tree. Your job is to count those family members who have no child.

Input

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.

Output

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

翻译:
一个家族的等级制度一般由族谱树体现,你的任务是算出那些没有子女的成员。
输入:
第一行包括N(0<N<100)——总成员数,M(M<N)——非叶子节点。
随后一共有M行,描述了每个非叶子节点的子节点的信息:
ID K sID[i] sID[2] ... sID[k]
ID代表当前结点,K表示该节点下的子节点的数量(限父级),sID[i]代表子节点的信息。
输出:
在一行内输出 每个depth的叶子节点的数量,不要打印多余的空格。

如:

思路:
递归查找,如果为叶子节点,跳出返回上个递归,并book[depth]+1,如果非,继续向下递归。

 


#define _CRT_SECURE_NO_WARNINGS
#include <vector>
#include <algorithm>
using namespace std;
vector v[100];
int book[100], maxdepth = -1;
void dfs(int index, int depth) {
	if (v[index].size() == 0) {
		book[depth]++;
		maxdepth = max(depth,maxdepth);
		//printf("发现:%d为一个叶子节点, 当前深度:%d发现的总叶子节点数:%d:\n", index,depth,book[depth]);
		return;
	}
	for (int i = 0; i < v[index].size(); i++){	
		dfs(v[index][i], depth + 1);
	}
}
int main() {
	int n, m, k, node, c;
	scanf("%d %d", &n, &m);
	for (int i = 0; i < m; i++) {
		scanf("%d %d", &node, &k);
		for (int j = 0; j < k; j++) {
			scanf("%d", &c);
			v[node].push_back(c);
		}
	}
	dfs(1, 0);
	// 为了没有额外的空格
	printf("%d", book[0]);
	for (int i = 1; i <= maxdepth; i++)
		printf(" %d", book[i]);
	return 0;
}