这个标程有点...

#include <bits/stdc++.h>
#define ll long long
using namespace std;
int cnt;
ll n,k;
unsigned ll ans;
ll Count(ll u,ll v)
{
    ll p = v;
    ll res = 0;
    while (p <= u) res += u / p, p *= v;
    return res;
}
int main()
{
    while (scanf("%lld%lld",&n,&k) != EOF)
    {
    ans = 4294967296LL * 2147483648LL - 1;//这里小坑
    ll K = k;
    for (ll i = 2; i * i <= k; ++i)
    {
        if (k % i == 0)
        {
            ll now = 0;
            while (k % i == 0) now ++, k /= i;
            if (ans == -1) ans = (unsigned ll)Count(n,i) / now;
           else  ans = min(ans, (unsigned ll)Count(n,i) / now);
        }
    }
    if (k != 1)
     if (ans == -1) ans = Count(n,k); else ans = min(ans,(unsigned ll )Count(n,k));
    cout<<ans<<endl;
    }
}