Cod sursa(job #2210089)
| Utilizator | Data | 5 iunie 2018 16:37:27 | |
|---|---|---|---|
| Problema | GFact | Scor | 5 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.81 kb |
#include <fstream>
using namespace std;
int putere(int mid,int p,int q)
{
int ci,cci=1;
if(p==1)
q=0;
else
for(int i=2;i<=mid;i+=cci)
{
ci=i;
if(ci%p==0)
{
cci=p;
while(ci%p==0)
{
q--;
ci/=p;
}
}
}
return q;
}
int main()
{
ifstream in ("gfact.in");
ofstream out ("gfact.out");
int st=1,p,q;
long long rez=1,dr;
int mid;
in>>p>>q;
dr=p*q;
while(st<=dr)
{
mid=(st+dr)/2;
if(putere(mid,p,q)>0)
st=mid+1;
else
{
rez=mid;
dr=mid-1;
}
}
out<<rez;
return 0;
}
