PAT-甲级-1004 Counting Leaves (30 分)

最新推荐文章于 2022-05-04 16:21:31 发布

黑火的柠檬树下快乐多

最新推荐文章于 2022-05-04 16:21:31 发布

阅读量273

点赞数

分类专栏： PAT 甲级考研上机考试算法竞赛

本文链接：https://blog.csdn.net/valcanoshan/article/details/96458572

版权

该博客介绍了一道编程题目，要求计算家族关系树中每个辈分没有孩子的家庭成员数量。通过深度优先搜索（DFS）策略遍历树结构，对于每个非叶子节点，若其无子节点，则在对应辈分的计数器中增加。最终输出每个辈分的无子节点数量。

摘要由CSDN通过智能技术生成

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.