Another Crisis

#include <map>
#include <set>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <vector>
#include <string>
#include <cctype>
#include <complex>
#include <cassert>
#include <utility>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
using namespace std;
typedef pair<int,int> PII;
typedef long long ll;
#define lson l,m,rt<<1
#define pi acos(-1.0)
#define rson m+1,r,rt<<11
#define All 1,N,1
#define N 100010
#define read freopen("in.txt", "r", stdin)
const ll  INFll = 0x3f3f3f3f3f3f3f3fLL;
const int INF= 0x7ffffff;
const int mod =  1000000007;
int dp[N],t,n;
vector<int>e[N];
int s[N];
void dfs(int root){
    int num=e[root].size();
    if(num==0){
        dp[root]=1;
        return ;
    }
    for(int i=0;i<num;++i)
    {
        int son=e[root][i];
        dfs(son);
    }
    for(int i=0;i<num;++i)
        s[i]=dp[e[root][i]];
    int len=ceil(1.0*t/100*num);
    sort(s,s+num);
    for(int j=0;j<len;++j)
        dp[root]+=s[j];
}
int main()
{
    while(~scanf("%d%d",&n,&t)){
        if(n==0&&t==0)break;
        for(int i=0;i<=n;++i)
            e[i].clear();
            int p;
        for(int i=1;i<=n;++i)
        {
            scanf("%d",&p);
            e[p].push_back(i);
        }
        memset(dp,0,sizeof(dp));
       dfs(0);
       printf("%d\n",dp[0]);
    }
return 0;
}