Cod sursa(job #3152491)
Utilizator | Data | 25 septembrie 2023 13:08:07 | |
---|---|---|---|
Problema | GFact | Scor | 20 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.57 kb |
#include <fstream>
using namespace std;
ifstream cin("gfact.in");
ofstream cout("gfact.out");
int main()
{
int p,q,d,x,n;
cin>>p>>q;
if(p%2==0)
d=max(p/2,2);
else
for(d=3;d*d<=p;d+=2)
if(p%d==0)
{
d=max(p/d,d);
break;
}
if(p%d!=0)
d=p;
p=0;
while(q>0)
{
x=d;
n=1;
p+=d;
while(p%x==0)
{
x*=d;
n++;
}
q=q-n+1;
}
cout<<p;
return 0;
}