1004 Counting Leaves（详细注解+30行代码）

我的多巴胺来自ac

于 2023-05-07 18:13:08 发布

阅读量241

点赞数

CC 4.0 BY-SA版权

分类专栏： pat甲级文章标签：深度优先图论算法

本文链接：https://blog.youkuaiyun.com/m0_66329385/article/details/130545857

这篇文章描述了一个使用C++编程解决的问题，涉及家族树的表示。给定一棵树的非叶节点信息，程序通过深度优先搜索来统计每层的叶节点数量，从根节点开始。输入包含树的节点数和非叶节点数，以及这些非叶节点的子节点信息。输出是每一层的叶节点数目。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

1004 Counting Leaves

分数 30

全屏浏览题目

切换布局

作者 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 Specification:

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.

The input ends with N being 0. That case must NOT be p