整除

#include <cstdio>
#include <cmath>
#include <algorithm>
#include <cstring>
using namespace std;
int cnt[1005], fact[100];
int solve(int n, int a) {
    int k = 0;
    for(int i = a; i <= n; i += a) {
        k++;
        int div = i / a;
        if(div % a == 0) {
            while(div % a == 0) {
                div /= a;
                k++;
            }
        }
    }
    return k;
}
int part(int a) {
    int sq = sqrt(a);
    int index = 0;
    for(int i = 2; i <= sq; i++) {
        if(a % i == 0) {
            fact[index++] = i;
            while(a % i == 0) {
                a /= i;
                cnt[i]++;
            }
        }
    }
    if(a > 1) {
        fact[index++] = a;
        cnt[a]++;
    }
    return index;
}
int main() {
    int n, a;
    scanf("%d%d", &n, &a);
    memset(cnt, 0, sizeof cnt);
    int pos = part(a);
    int ans = 1000;
    for(int i = 0; i < pos; i++) {
        ans = min(ans, solve(n, fact[i]) / cnt[fact[i]]);
    }
    printf("%d\n", ans);
    return 0;
}