Cod sursa(job #3331083)
| Utilizator | Data | 24 decembrie 2025 12:40:47 | |
|---|---|---|---|
| Problema | GFact | Scor | 60 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 1 kb |
#include <bits/stdc++.h>
using namespace std;
int nrprim[15];
int totprim[15];
int k=0;
void Desc(int a)
{
int d=2;
while(a>1)
{
int cnt=0;
while(a%d==0)
{
cnt++;
a=a/d;
}
if(cnt!=0)
{
nrprim[k]=d;
totprim[k]=cnt;
k++;
}
if(d*d>a && a!=1)
{
d=a;
}
d++;
}
}
int main()
{
ifstream cin("gfact.in");
ofstream cout("gfact.out");
int p,q;
int rez=0;
cin>>p>>q;
Desc(p);
for(int i=0;i<k;i++)
{
int cnt=totprim[i]*q;
int nr=nrprim[i];
int j=nr;
while(cnt>0)
{
int cj=j;
while(cj%nr==0)
{
cnt--;
cj=cj/nr;
}
if(cnt<=0)
break;
j+=nr;
}
rez=max(rez,j);
}
cout<<rez;
return 0;
}
