细胞分裂

https://ac.nowcoder.com/acm/contest/948/A

思路：化简即：(s^k)%(m1^m2) ==0最小的k；将m1素因子分解，再逐个s分解判断；

反思：不能先将s全部分解保存再逐个判断Min，会tle。

 

#include<algorithm>
#include<set>
#include<cmath>
#include<cstring>
#include<iostream>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstdio>
#include<map>
#include<stack>
#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-16
#define PI acos(-1)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson rt<<1,l,mid
#define rson rt<<1|1,mid+1,r
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

const int maxn=1e6+9;
const int mod=1e9+7;

inline ll read()
{
    ll f=1,x=0;
    char ss=getchar();
    while(ss<'0'||ss>'9')
    {
        if(ss=='-')f=-1;ss=getchar();
    }
    while(ss>='0'&&ss<='9')
    {
        x=x*10+ss-'0';ss=getchar();
    }    return f*x;
}

ll power(ll x,ll n)
{
    ll ans=1;
    while(n)
    {
        if(n&1) ans=ans*x;
        x=x*x;
        n>>=1;
    }
    return ans;
}

int pre[maxn];
bool vis[maxn];
int cnt;
int mexp[maxn];
int p[maxn];
void P()
{
    mem(vis,1);
    for(int i=2;i<maxn;i++)
    {
        if(vis[i])
        {
            pre[cnt++]=i;
            for(int j=i+i;j<maxn;j+=i) vis[j]=0;
        }
    }
}
int main()
{
    //FAST_IO;

    P();
    int n;
    while(cin>>n)
    {
        mem(mexp,0);
        mem(p,0);
        int mcnt=0;
        int m1,m2;
        cin>>m1>>m2;
        for(int i=0;i<cnt;i++)
        {
            if(m1%pre[i]==0)
            {
                p[mcnt]=pre[i];
                while(m1%pre[i]==0) m1/=pre[i],mexp[mcnt]++;
                mcnt++;
            }
        }
        if(m1!=1) p[mcnt]=m1,mexp[mcnt++]++;
        /*for(int i=0;i<mcnt;i++)
        {
            cout<<p[i]<<" "<<mexp[i]<<endl;
        }*/
        int ans=INF;
        while(n--)
        {
            int Min=0;
            int ex=0;
            bool f=1;
            ll s;
            cin>>s;
            for(int i=0;i<mcnt;i++)
            {
                ex=0;
                if(s%p[i]!=0)
                {
                    f=0;
                    break;
                }
                while(s%p[i]==0) s/=p[i],ex++;
                //cout<<p[i]<<" "<<ex<<endl;
                Min=max(Min,(mexp[i]*m2-1)/ex+1);

            }
            if(!f)continue;
            //cout<<Min<<endl;
            ans=min(ans,Min);
        }
        if(ans!=INF)
            cout<<ans<<endl;
        else cout<<-1<<endl;

    }
    return 0;
}