【PAT1004】Counting Leaves

<span style="font-size:12px;">#include <stdio.h>
int node,cnt[110],map[110][110];
void dfs (int num,int level){
	if (cnt[level]==-1){
	cnt[level]=0;}
	int mark=0;
	for (int i=1;i<node ;i++ ){
		if (map[num][i]==1){
            mark=1;
			dfs(i,level+1);
		}
	}
    if (mark==0){
		cnt[level]++;
    }
}
int main(int argc, char *argv[])
{
	int nonleaf;
	scanf ("%d %d",&node,&nonleaf);

    for (int i=1;i<=100 ;i++ ){
		cnt[i]=-1;
		for (int j=1;j<100 ;j++ ){
			map[i][j]==0;
		}
    }

	int ID,K,son;
	for (i=0;i<node ;i++ )
	{
		scanf("%d %d",&ID,&K);
		for (j=0;j<K ;j++ )
		{
			scanf("%d",&son);
			map[ID][son]=1;
		}
	}
	
dfs(1,1);
for (i=1;i<=node ;1++ )
{
	if (cnt[i]!=-1&&i==1)printf ("%d",cnt[i]);//=&==,be careful
	else if (cnt[i]!=-1)printf (" %d",cnt[i]);
}
	
	
	return 0;
}
</span>

时间限制

400 ms

内存限制

32000 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

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

分析：同1003一样，使用dfs 

1）递归未必在递归到某个特定条件结束，也可以如此题一样“自然散尽”；

2）递归不一定要返回什么，直接对全局变量操作；

3）DFS 大致为 主函数输入输出，初始化，DFS几个部分；其中DFS的功能因题而变，要多多接触！