1004 Counting Leaves （30 分）树的遍历，dfs，或bfs(层序遍历),vector

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 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

- vector< type >vec;
vec.push_back( x );
for(int i=0;i<vec.size();i++)cout<<vec[i];

#include<iostream>
#include<cstdio>
#include<vector>
using namespace std;
int n,m,f,k,t;
vector<int>nt[105];
int sg[105];
int depth=0;
void dfs(int index,int level)
{
	if(nt[index].size()==0)
	{
		sg[level]++;
		if(depth<level)depth=level;
		return;
	}
	for(int i=0;i<nt[index].size();i++)
	{
		dfs(nt[index][i],level+1);
	}
}
int main()
{
	scanf("%d%d",&n,&m);
	for(int i=1;i<=m;i++)
	{
		scanf("%d%d",&f,&k);
		for(int j=1;j<=k;j++)
		{
			scanf("%d",&t);
			nt[f].push_back(t);
		}
	}
	dfs(1,0);
	for(int i=0;i<depth;i++)
	{
		printf("%d ",sg[i]);
	}
	printf("%d\n",sg[depth]);
	return 0;
}