1004 Counting Leaves C语言

@PAT 题库1004 Counting Leaves (30 分)

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.

Output Specification:

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

代码如下：

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#define max(a,b) (a>b ? a:b)

int mark[102];
int dep[102];
int f[102];
int haveSon[102];
int a[102];

int getDep(int x) {
    return ((!mark[x]) || (f[x] < 0))?0:(1 + getDep(f[x]));
}


int main() {
    int i,n, m;
    scanf("%d%d",&n,&m);
    if (m == 0) {
        puts("1");
        return 0;
    }
    for (memset(f, 0xff, sizeof(f));m;--m) {
        int x,y;
        for (scanf("%d%d",&x,&y);y;--y) {
            int z;
            scanf("%d",&z);
            mark[z] = 1;
            f[z] = x;
        }
        mark[x] = haveSon[x] = 1;
    }
    n = 0;
    for ( i = 0; i < 102; ++i) {
        if (mark[i]) {
            dep[i] = getDep(i);
            if (!haveSon[i]) {
                ++a[dep[i]];
            }
            n = max(n, dep[i]);
        }
    }
    for ( i = 0; i <= n; ++i) {
        if (i) {
            putchar(' ');
        }
        printf("%d",a[i]);
    }
    puts("");
    return 0;
}