pat1004 Counting Leaves

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
using namespace std;
vector<int>tr[105];
int ans[105];
int mx;
void dfs(int u,int fa,int dep)
{
  if(tr[u].size() == 0)ans[dep]++;
  mx = max(mx,dep);
  for(int i = 0;i<tr[u].size();i++)
  {
    dfs(tr[u][i],u,dep+1);
  }
}
int main()
{
  int n,m,i,j,a,k,b;
  while(scanf("%d%d",&n,&m)!=EOF)
  {
    mx = -1;
    for(i = 0;i<m;i++)
    {
      scanf("%d %d",&a,&k);
      for(j = 0;j<k;j++)
      {
        scanf("%d",&b);
        tr[a].push_back(b);
      }
    }
    memset(ans,0,sizeof(ans));
    dfs(1,-1,1);
    for(i = 1;i<=mx;i++)
    {
      printf("%d",ans[i]);
      if(i!=mx)printf(" ");
      else printf("\n");
    }
  }
  return 0;
}