1004. Counting Leaves (30)

た入场券 2022-05-31 06:37 94阅读 0赞

# 1004. Counting Leaves (30) #

时间限制

400 ms

内存限制

65536 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

--------------------

题目

发表评论取消回复

表情：

评论列表（有 0 条评论，94人围观）

还没有评论，来说两句吧...

相关阅读

相关 1004 Counting Leaves（树，层次遍历）

1004 Counting Leaves 0、题目 A family hierarchy is usually presented by a pedigree tr

秒速五厘米/ 2024年04月08日 08:43/ 0 赞/ 36 阅读

相关 PAT 甲级 1004 Counting Leaves (30 分) 遍历树求解

1.题目翻译输入：每个输入文件包含一个测试用例。每种情况都从包含0 <N <100（树中的节点数）和M（<N）（非叶节点数）的行开始。然后是M行，每行的格式为：

ゝ一世哀愁。/ 2023年08月17日 16:27/ 0 赞/ 84 阅读

相关 PTA 1004 Counting Leaves (30 分)（详细翻译+注释）

背景： A family hierarchy is usually presented by a pedigree tree. Your job is to count

怼烎@/ 2022年09月04日 03:45/ 0 赞/ 209 阅读

相关 Python实现Pat 1004. Counting Leaves (30)

[题目][Link 1] A family hierarchy is usually presented by a pedigree tree. Your job is

矫情吗；*/ 2022年06月04日 07:39/ 0 赞/ 135 阅读

相关 1004. Counting Leaves (30)

1004. Counting Leaves (30) 时间限制 400 ms 内存限制 65536 kB 代码长度限制 16000 B 判题

妖狐艹你老母/ 2022年05月31日 06:37/ 0 赞/ 127 阅读

相关 1004. Counting Leaves (30)

1004. Counting Leaves (30) 时间限制 400 ms 内存限制 65536 kB 代码长度限制 16000 B 判题

た入场券/ 2022年05月31日 06:37/ 0 赞/ 95 阅读

相关 (PAT 1004) Counting Leaves (树的广度优先)

A family hierarchy is usually presented by a pedigree tree. Your job is to count those f

左手的ㄟ右手/ 2022年03月21日 05:20/ 0 赞/ 120 阅读

相关 PAT甲级 - 1004 Counting Leaves （30 分）

题目链接：[（PAT甲级）1004 Counting Leaves （30 分）][PAT_1004 Counting Leaves _30] A family hierar

迷南。/ 2022年03月19日 16:29/ 0 赞/ 158 阅读

相关 PAT_A1004#Counting Leaves

Source: > [PAT A1004 Counting Leaves (30 分)][PAT A1004_Counting Leaves_30] Descript

小鱼儿/ 2021年12月20日 06:34/ 0 赞/ 137 阅读

相关 PAT A1004 Counting Leaves

本程序为PAT A1004 Counting Leaves答案，[题目链接][Link 1]。主体思想：算法主要采用DFS算法，深度优先访问每一个结点，检查其是否为叶子结点

清疚/ 2021年09月29日 07:48/ 0 赞/ 176 阅读