Cod sursa(job #2795441)
| Utilizator | Data | 6 noiembrie 2021 13:00:22 | |
|---|---|---|---|
| Problema | GFact | Scor | 20 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 1.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("gfact.in");
ofstream fout("gfact.out");
int ciur[100000005],f[100000005];
int main()
{
int p,q,aux,dmax=2;
fin>>p;
ciur[0]=ciur[1]=1;
for(int i=2;i*i<=1000000;i++)
{
if(ciur[i]==0)
{
for(int j=i*i;j<=1000000;j+=i)
{
ciur[j]=1;
}
}
}
fin>>q;
aux=p;
while(p%2==0)
{
p=p/2;
f[2]++;
}
for(int d=3;d<=p;d+=2)
{
if(ciur[d]==0 && p%d==0)
{
dmax=max(d,dmax);
f[d]++;
}
}
p=aux;
int x,cnt=0,ok=0,sol;
for(int i=1;i<=dmax;i++)
{
f[i]=f[i]*q;
}
int l=0,r=1000000000,mid;
while(l<=r)
{
ok=0;
mid=(r+l)/2;
aux=mid;
for(int i=1;i<=dmax;i++)
{
if(f[i]!=0)
{
cnt=0;
x=f[i];
while(mid!=0)
{
cnt+=mid/i;
mid=mid/i;
}
if(cnt<x)
{
ok=1;
break;
}
}
}
if(ok==1) l=aux+1;
else
{
r=aux-1;
sol=aux;
}
}
fout<<sol;
return 0;
}
