C. Trailing Loves (or L'oeufs?) （质因数分解）

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define N 1000005
ll pri[N];
ll cnt[N];
ll tot;
void getpri(ll x)
{
    memset(cnt,0,sizeof(cnt));
    memset(pri,0,sizeof(pri));
    for(ll i=2;i*i<=x;i++)
    {
        while(x%i==0)
        {
            pri[tot]=i;
            cnt[tot]++;
            x/=i;
        }
        if(cnt[tot]) tot++;
    }
    if(x>1) pri[tot]=x,cnt[tot++]++;
}
ll solve(ll x,ll p)
{
    ll res=0;
    while(x)
    {
        res+=x/p;
        x/=p;
    }
    return res;
}
int main()
{
    ll n,b;
    while(~scanf("%lld %lld",&n,&b)){
            tot=0;
        getpri(b);
        ll maxn=1e18;
        /*for(int i=0;i<tot;i++)
            cout<<pri[i]<<" "<<cnt[i]<<endl;*/
        for(ll i=0;i<tot;i++)
        {
            maxn=min(maxn,solve(n,pri[i])/cnt[i]);
        }
        printf("%lld\n",maxn);
    }

    return 0;
}