Flatten-分解因数

Flatten-分解因数

链接

题解
看似直接求lcm，但会超时。选择分解因数，通过个因数出现的次数求出最大公倍数。

代码

#include<bits/stdc++.h>
using namespace std;
#define ll  long long
#define ull unsigned long long
#define ld long double
inline int read()
{
    char ch = getchar();int x = 0, f = 1;
    while(ch<'0'||ch>'9'){if(ch == '-') f = -1;ch = getchar();}
    while('0'<=ch && ch <= '9'){x = x*10+ch-'0';ch = getchar();}
    return x*f;
}
ll mod=1e9+7;
ll INF=1e15;
ll Inf=0x3f3f3f3f;
 
ll ksm(ll a,ll b){
    ll res=1;
    while(b){
        if(b&1) res=res*a%mod;
        a=a*a%mod;
        b>>=1;
    }
    return res%mod;
}
ll arr[1000007];
ll mp[1000007];
ll maxx;

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
     
    int n;
    cin>>n;
    maxx=0;
    for(int i=0;i<n;++i)
    {
        cin>>arr[i];
        maxx=max(maxx,arr[i]);
    }
    for(int i=0;i<n;++i)
    {
        ll tmp=arr[i];
        ll bond=sqrt(tmp);
        for(ll j=2;j<=bond;++j)
        {
            ll cnt=0;
            while(tmp%j==0)    
            {
                cnt++;
                tmp/=j;
            }
            mp[j]=max(mp[j],cnt);
        }
        if(tmp!=1)
            mp[tmp]=max(mp[tmp],1ll);
    }
    ll sum=1;
    for(ll i=2;i<=maxx;++i)
        sum=sum*ksm(i,mp[i])%mod;
    //cout<<sum<<endl;
    ll ans=0;
    for(int i=0;i<n;++i)
    {
        ans=(ans+sum*ksm(arr[i],mod-2)%mod)%mod;
    }
    cout<<ans<<endl;
    return 0;
}