【PAT】1004 Counting Leaves (30 分)

#include <bits/stdc++.h>
using namespace std;

const int MAXN = 110;
vector<int> T[MAXN];
int num[MAXN];
int max_depth=1;
void countLeaves(int index,int depth){
    if(depth>max_depth) max_depth=depth;
    if(T[index].size()==0){//叶结点
        num[depth]++;
        return;
    }
    for(int i=0;i<T[index].size();i++){
        countLeaves(T[index][i],depth+1);
    }
}
int main(){
    int n,m,tmp,tmpn,tmpt;
    scanf("%d %d",&n,&m);
    for(int i=0;i<m;i++){
        scanf("%02d %d",&tmp,&tmpn);
        while(tmpn--){
            scanf("%02d",&tmpt);
            T[tmp].push_back(tmpt);
        }
    }
    countLeaves(1,1);
    for(int i=1;i<=max_depth;i++){
        printf("%s%d",i==1?"":" ",num[i]);
    }
    return 0;
}