Pagini recente » Cod sursa (job #2130730) | Cod sursa (job #301533) | Cod sursa (job #2575657) | Cod sursa (job #1581859) | Cod sursa (job #1220929)
#include <cstdio>
int n, x;
int mod=1999999973;
void citire()
{
scanf("%d%d", &n, &x);
}
int ridp(int n, int x)
{
int nr=0;
if(x==0)
return 1;
if(x%2==0)
{
nr=ridp(n,x/2);
return ((nr)*(nr));
}
else
{
return ((ridp(n, x-1))*(n));
}
}
void rezolva_problema()
{
int p=0;
citire();
p=ridp(n,x);
printf("%d\n", p);
}
int main()
{
freopen("lgput.in", "r", stdin);
freopen("lgput.out", "w", stdout);
rezolva_problema();
return 0;
}