Pagini recente » Cod sursa (job #1967766) | Cod sursa (job #727848) | Cod sursa (job #1656192) | Cod sursa (job #2452571) | Cod sursa (job #1256614)
#include <iostream>
#include <fstream>
#define nmax 2000000
#define h 2048
using namespace std;
int64_t p,q,a;
ifstream fin("gfact.in");
ofstream fout("gfact.out");
double PutereLogaritmic(double x, int n)
{
double p = 1 ;
while (n > 0)
{
if (n & 1)
{
p *= x;
n-- ;
}
x = x * x ;
n >>= 1 ;
}
return p ;
}
int b[100];
void CountFacts()
{
int i;
b[1]=1;
for(i=2;i<=127;i++)
b[i]=i*b[i-1];
}
int main()
{
fin>>p>>q;
a=PutereLogaritmic(p,q);
CountFacts();
int i;
for(i=2;i<=127;i++)
if(b[i]% a==0)
{
fout<<i;
break;
}
fin.close();
fout.close();
return 0;
}