pat甲级 -1004 Counting Leaves (30分) 第二个测试点的坑

最新推荐文章于 2022-07-26 16:28:25 发布

tangqiqistyle

最新推荐文章于 2022-07-26 16:28:25 发布

阅读量1.3k

点赞数 2

分类专栏： c++代码文章标签： c++

本文链接：https://blog.youkuaiyun.com/tangqiqistyle/article/details/104162987

版权

该博客主要介绍了一道PAT甲级编程题，题目要求计算家族树中每层的叶子节点数量。博客作者通过BFS（广度优先搜索）算法来解决此问题，并提供了详细的代码实现，强调了测试点的注意事项，特别是根节点必须为'01'。

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

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 processed.