2019ICPC徐州 E.Multiply（大数质因子分解）

题意：

数据范围：2<=n<=1e5，2<=X,Y<=1e18，a(i)<=1e18，sum(a(i))<Y

解法：

对X进行质因子分解,记录所有质因子及其指数.
计算出X的每个质因子在Y!/Z中还剩下多少个,
假设X的质因子为p,Y!/Z中有还剩下t个p,
那么X最多t/p个,对所有t[i]/p[i]取min就是答案.
因为数据范围较大,因此需要用大数质因子分解算法.

Q:如何判断Y!中包含多少个p?
A:代码如下,原理这里就不解释了.
ll cal(ll n,ll x){
    ll ans=0;
    while(n){
        ans+=n/x;
        n/=x;
    }
    return ans;
}

解法：

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxm=2e5+5;
ll a[maxm];
ll n,x,y;
ll temp[maxm],cnt;
pair<ll,ll>p[maxm];
//板子:
ll gcd(ll a, ll b) {
    return b ? gcd(b, a % b) : a;
}
ll quick_mult(ll a, ll b, ll mod) {
    ll ans = 0;
    while(b) {
        if(b & 1) ans = (ans + a) % mod;
        a = (a + a) % mod;
        b >>= 1;
    }
    return ans;
}
ll quick_pow(ll a, ll n, ll mod) {
    ll ans = 1;
    while(n) {
        if(n & 1) ans = quick_mult(ans, a, mod);
        a = quick_mult(a, a, mod);
        n >>= 1;
    }
    return ans;
}
bool miller_rabin(ll n) {
    if(n == 2) return true;
    if(n < 2 || !(n & 1)) return false;
    ll s = 0, d = n - 1;
    while(!(d & 1)) {
        d >>= 1;
        s++;
    }
    for(int i = 1; i <= 11; i++) {
        ll a = rand() % (n - 2) + 2;
        ll now = quick_pow(a, d, n), pre = now;
        for(int j = 1; j <= s; j++) {
            now = quick_mult(now, now, n);
            if(now == 1 && pre != 1 && pre != n - 1) return false;
            pre = now;
        }
        if(now != 1) return false;
    }
    return true;
}
ll pollard_rho(ll n, int c) {
    ll x, y, i = 1, k = 2;
    x = y = rand() % (n - 2) + 2;
    for( ; ; ) {
        i++;
        x = (quick_mult(x, x, n) + c) % n;
        ll g = gcd(y - x, n);
        if(g > 1 && g < n) return g;
        if(x == y) return n;
        if(i == k) y = x, k <<= 1;
    }
}
void find_fac(ll n, int k) {
    if(n == 1) return ;
    if(miller_rabin(n)) {
        temp[++cnt]=n;
        return ;
    }
    ll p = n;
    int c = k;
    while(p >= n) p = pollard_rho(p, c--);
    find_fac(p, k);
    find_fac(n / p, k);
}
//
ll cal(ll n,ll x){
    ll ans=0;
    while(n){
        ans+=n/x;
        n/=x;
    }
    return ans;
}
void solve(){
    cnt=0;
    find_fac(x,1111);
    sort(temp+1,temp+1+cnt);
    int tot=1;
    p[1]={temp[1],1};
    for(int i=2;i<=cnt;i++){
        if(temp[i]==p[tot].first)p[tot].second++;
        else p[++tot]={temp[i],1};
    }
    ll ans=4e18;
    for(int i=1;i<=tot;i++){
        ll num=0;
        for(int j=1;j<=n;j++){
            num+=cal(a[j],p[i].first);
        }
        ll t=cal(y,p[i].first)-num;
        if(t<0)t=0;
        ans=min(ans,t/p[i].second);
    }
    printf("%lld\n",ans);
}
int main(){
    int T;
    scanf("%d", &T);
    while (T--) {
        srand((unsigned)time(NULL));
        scanf("%lld%lld%lld", &n,&x,&y);
        for(int i=1;i<=n;i++){
            scanf("%lld",&a[i]);
        }
        solve();
    }
    return 0;
}

---