1004. Counting Leaves (树)
来源:互联网 发布:淘宝vip等级在那里看 编辑:程序博客网 时间:2024/06/18 01:33
1004. Counting Leaves (30)
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 Input2 101 1 02Sample Output
0 1
代码如下:
#include <stdio.h>#include <math.h>#include <string.h>#include <algorithm>using namespace std;int b[101],a[101][101],s[101],maxx;void dfs(int n,int m){ if(b[n]==0) { s[m]++; maxx = maxx>m ? maxx : m;///记录最大层数 return; } for(int i=0;i<b[n];i++)///深搜每一个子结点 dfs(a[n][i],m+1);}int main(){ int n,m,id,k; scanf("%d %d",&n,&m); while(m--) { scanf("%d %d",&id,&k); b[id]=k;///存储id的子结点数 for(int i=0;i<k;i++) scanf("%d",&a[id][i]); } dfs(1,0); for(int i=0;i<maxx;i++) printf("%d ",s[i]); printf("%d\n",s[maxx]); return 0;}
- 1004. Counting Leaves (树)
- PAT-A 1004. Counting Leaves (30) (树)
- (PAT)1004.Counting Leaves (30)
- PAT 1004. Counting Leaves (30)(BFS)
- 1004. Counting Leaves (30)(PAT甲)
- PAT (A )1004. Counting Leaves (30)
- 1004. Counting Leaves
- 1004. Counting Leaves (30)
- 1004. Counting Leaves
- 1004. Counting Leaves (30)
- 1004. Counting Leaves
- 1004. Counting Leaves (30)
- 1004. Counting Leaves (30)
- 1004. Counting Leaves (30)
- 1004. Counting Leaves (30)
- 1004. Counting Leaves (30)
- 1004.Counting Leaves
- 1004. Counting Leaves (30)
- 数据结构——线性结构(8)——动态数组与Vector
- 实验三顺序队列
- Java 封装类型和基本类型区别
- 开发中数据库常见的设计问题
- Matlab的图像
- 1004. Counting Leaves (树)
- PAT 1003. Universal Travel Sites (35)
- 维纳滤波运动模糊图像复原
- SpringCloud(第 046 篇)注解式Schedule配置定时任务,不支持任务调度
- 寻找链表的中间节点
- Maven项目报错:Failed to read artifact descriptor for ***
- Island Perimeter (中)
- SpringCloud(第 047 篇)注解式Async配置异步任务
- new操作符不分配内存,只调用构造函数