HDU3988 Harry Potter and the Hide Story

首先对K进行素因子分解,分解成:p1^r1 * p2^r2*...pk^rk.

然后求出n!含有的K的因子pi的个数,把这个数除以ri得到一个值,取这个值最小值就是答案.

#include <iostream>
#include <memory.h>
#include <cstdio>
using namespace std;
#define INF 9223372036854775807LL
const int MAX = 10000050;

long long prime[MAX / 10], prime_idx;
long long p_facs[100];
long long expo[100];
bool is_prime[MAX];

void init_prime(){
    memset(is_prime + 2, true, sizeof(is_prime));
    for(int i = 2; i < MAX; ++i){
        if(is_prime[i]){
            prime[prime_idx++] = i;
            for(int j = i + i; j < MAX; j += i){
                is_prime[j] = false;
            }
        }
    }
}

int main(){
    init_prime();
    int T, caseno = 1;
    scanf("%d", &T);
    while(T--){
        long long K, N, ans = INF;
        int fac_idx = 0;
        scanf("%I64d%I64d", &N, &K);
        printf("Case %d: ", caseno++);
        if(K == 1){
            printf("inf\n");
            continue;
        }
        for(int i = 0; i < prime_idx && prime[i] * prime[i] <= K; ++i){
            if(K % prime[i] == 0){
                expo[fac_idx] = 0;
                while(K % prime[i] == 0){
                    ++expo[fac_idx];
                    K /= prime[i];
                }
                p_facs[fac_idx++] = prime[i]; 
            }
        }
        if(K != 1){
            expo[fac_idx] = 1;
            p_facs[fac_idx++] = K;
        }

        for(int i = 0; i < fac_idx; ++i){
            long long n_expo = 0;
            long long t = N; 

            while(t){
                n_expo += t / p_facs[i];
                t /= p_facs[i];
            }
            ans = min(ans, n_expo / expo[i]);
        }
        printf("%I64d\n", ans);
    }
    return 0;
}