1004. Counting Leaves (30)
来源:互联网 发布:笛佛软件面试 编辑:程序博客网 时间:2024/04/28 16:08
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 <iostream>#include <cstdio>#include <vector>using namespace std;/* * 此题是树题目 */vector<int> node[100];int num[100] = {0};void DFS(int root, int height) //使用深搜{int size = node[root].size();if (size == 0)++num[height];else{for (int i = 0; i < size; ++i)DFS(node[root][i], height+1);}}int main(void){int n, m; //n节点总数,m非叶子节点数scanf("%d%d", &n, &m);int par, son, k;for (int i = 0; i < m; ++i){scanf("%d%d", &par, &k);for (int j = 0; j < k; ++j){scanf("%d", &son);node[par].push_back(son);}}DFS(1, 0);int i = 99;while (!num[i])--i;for (int j = 0; j < i; ++j)printf("%d ", num[j]);printf("%d\n", num[i]);return 0;}
- 1004. Counting Leaves (30)
- 1004. Counting Leaves (30)
- 1004. Counting Leaves (30)
- 1004. Counting Leaves (30)
- 1004. Counting Leaves (30)
- 1004. Counting Leaves (30)
- 1004. Counting Leaves (30)
- 1004. Counting Leaves (30)
- 1004. Counting Leaves (30)
- 1004. Counting Leaves (30)
- 1004. Counting Leaves (30)
- 1004. Counting Leaves (30)
- 1004. Counting Leaves (30)
- 1004. Counting Leaves (30)
- 1004. Counting Leaves (30)
- 1004. Counting Leaves (30)
- 1004. Counting Leaves (30)
- 1004. Counting Leaves (30)
- C++中的#,##,和"
- 文件系统错误故障排除
- UVALive - 2678 Subsequence
- 算法练习--多项式加法
- Redis源码学习2-内存管理
- 1004. Counting Leaves (30)
- 030变态跳台阶(keep it up)
- .Net程序员玩转Android开发---(12)ListView显示数据
- Hadoop 源码下载打包
- 块级元素、内联元素学习笔记
- NoSQL数据库笔谈
- 关于Java 传递参数时的问题
- Apache-mina框架学习之简单的用户登录与注册(MySql数据库)
- 3、Spring4之Bean 配置的细节