PAT (A )1004. Counting Leaves (30)
来源:互联网 发布:java 堆内存 编辑:程序博客网 时间:2024/06/07 04:05
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
——————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————
树结构 遍历
Errors:1.queue的front()不叫pop ()
2.vector 删除第一位元素方法
#include<cstdio> #include<vector>#include <algorithm>#include <iostream>#include <cstring> #include<queue>using namespace std;int main() { int nodes; int internal; int children[101][101]; cin>>nodes>>internal; int n=internal; int num[101]={0}; int now; int childrennum; vector<int> ans; while(n!=0){ cin>>now>>childrennum; num[now]=childrennum; for(int i =1;i!=childrennum+1;i++){ cin>>children[now][i]; } n--; } queue<int> next; int sum; next.push(1); while(next.size()!=0){ sum=0; queue<int> now; while(next.size()!=0){ int i=next.front(); if(num[i]==0) {sum++; } else{ for(int k=1;k!=num[i]+1;k++){ now.push(children[i][k]); } } next.pop(); } ans.push_back(sum);next=now; } for(int l=0;l!=ans.size();l++){ if(l!=ans.size()-1)cout<<ans[l]<<" " ; else cout<<ans[l]<<endl ; } return 0;}
- PAT (A )1004. Counting Leaves (30)
- PAT A 1004. Counting Leaves (30)
- PAT-A 1004. Counting Leaves (30) (树)
- PAT(A) 1004. Counting Leaves (30)
- PAT A 1004. Counting Leaves (30)
- PAT-A-1004. Counting Leaves (30)
- PAT-A 1004. Counting Leaves (30)
- PAT-A 1004.Counting Leaves
- (PAT)1004.Counting Leaves (30)
- PAT 1004. Counting Leaves (30)(BFS)
- 1004. Counting Leaves (30)(PAT甲)
- 1004. Counting Leaves (30)-PAT
- pat 1004. Counting Leaves (30)
- 【PAT】1004. Counting Leaves (30)
- PAT 1004. Counting Leaves (30)
- PAT 1004. Counting Leaves (30)
- pat 1004. Counting Leaves (30)
- PAT 1004. Counting Leaves (30)
- JS中的call()和apply()方法详解
- 批处理在TXT文本每一行的行首和行尾插入指定字符串
- IntelliJ IDEA 快速入门指南
- 全面的介绍retrofit的文章
- 分布式Session的几种实现方式
- PAT (A )1004. Counting Leaves (30)
- VMware中Centos中启动停止nginx的三种方法
- B+/-树
- tomcat 学习一
- 2017/7/14 学习心得 jquery补充
- Android Service完全解析,关于服务你所需知道的一切(上)
- 甲骨文oracle云计算迎来转机
- C# 多线程
- 三步让你的思维导图更好看