Pagini recente » Cod sursa (job #3176340) | Cod sursa (job #1687129) | Istoria paginii runda/simulare_oji_2023_clasa_10_14_martie/clasament | Cod sursa (job #2074915) | Cod sursa (job #1488322)
#include <stdio.h>
#define inff 1999999973
using namespace std;
int x, n;
void read()
{
scanf("%d %d", &x, &n);
}
int solve(int x, int n)
{
if(n == 0)
return 1;
if(n == 1)
return x;
if(n % 2 == 0)
return solve(x * x, n / 2) % inff;
if(n % 2 != 0)
return (x * solve(x * x, (n - 1)/2)) % inff;
}
int main()
{
freopen("lgput.in","r",stdin);
freopen("lgput.out","w",stdout);
read();
printf("%d", solve(x, n));
fclose(stdin);
fclose(stdout);
return 0;
}