1004 Counting Leaves c++

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

#include 
using namespace std;
struct node{
    int id;
    vectorchild;
}a[110];

void init(){
    int n,m;cin>>n>>m;
    for(int i=0;i
        int id,k;cin>>id>>k;
        for(int j=0;j
            int temp;cin>>temp;
            a[id].child.push_back(temp);
        }
    }
}

vectorans(100,0);
int Depth=0;
void dfs(int depth,int root){
    if(depth>Depth)
        Depth=depth;
    if(a[root].child.size()==0)
        ans[depth]++;
    vectorv(a[root].child);
    for(int i=0;i
    init();
    dfs(0,1);
    for(int i=0;i
        if(i==0)
            cout<