Pagini recente » Cod sursa (job #2111083) | Cod sursa (job #1768470) | Cod sursa (job #382636) | Cod sursa (job #2634141) | Cod sursa (job #2070617)
#include <iostream>
#include <fstream>
using namespace std;
int factorial(int x,int p)
{
int i=1,aux;
while(p>0)
{
aux=i;
while(aux%x==0)
{
aux=aux/x;
p--;
}
i++;
}
return i;
}
void factdominant(int x, int &a, int &pa)
{
int i,pi,aux;
aux=x;
for(i=2;i<=aux && x!=1 ;i++)
{
pi=0;
while(x%i==0)
{
x=x/i;
pi++;
}
if(factorial(i,pi)>factorial(a,pa))
{
a=i;
pa=pi;
}
}
}
int numarp(long long x,int p)
{
int nrp=0;
while(x!=0)
{
nrp=nrp+x/p;
x=x/p;
}
return nrp;
}
int a,pa;
const int L=30;
int main()
{
int p,q,r;
long long pas;
ifstream f("gfact.in");
ofstream g("gfact.out");
f>>p>>q;
factdominant(p,a,pa);
p=a;
q=q*pa;
r=0;
pas=1<<L;
while(pas!=0)
{
if(numarp(r+pas,p)<q)
r=r+pas;
pas=pas/2;
}
r++;
g<<r;
return 0;
}