Pagini recente » Cod sursa (job #2853735) | Cod sursa (job #218124) | Cod sursa (job #223952) | Cod sursa (job #3233844) | Cod sursa (job #2054809)
#include <iostream>
#include <stdio.h>
using namespace std;
int p,q,b;
long long int factorial(int n)
{ long long int p = 1 ;
for ( int i = 1 ; i <= n ; ++i)
p*=i;
return p;
}
void r()
{freopen("gfact.in","r",stdin);
scanf("%d%d",&p,&q);
}
long long int putere(int a , int b)
{
long long int p = 1 ;
while(b)
{
if( b & 1)p*=a, --b;
a*=a;
b>>=1;
}
return p;
}
int main()
{
r();
long long int nr = putere(p,q);
freopen("gfact.out","w",stdout);
for(int i = 1 ; i <= 20 ; ++i)
if(factorial(i) % nr == 0)
{cout << i;
break;}
cout <<endl;
//for ( int i = 1 ; i <= 2000 ; ++i)
//{
//for ( int j = 1 ; j <= 20 ; ++j)
//if(factorial(j) % i ==0){cout<<"Pentru numarul "<<i<<" este "<<j<<endl; break;}
//}
return 0;
}