Pagini recente » Cod sursa (job #1998511) | Cod sursa (job #2671452) | Cod sursa (job #1982641) | Cod sursa (job #353664) | Cod sursa (job #1938467)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("lgput.in");
ofstream fout("lgput.out");
const int MOD = 1999999973;
long long int ridica(long long int n, long long int p)
{
if (p == 1)
return n;
if (p % 2 == 0)
{
long long int i = ridica(n & MOD, (p / 2) % MOD) % MOD;
return (i * i) % MOD;
}
long long int i = ridica(n % MOD, (p / 2) % MOD) % MOD;
return ((i * i) % MOD) * (n % MOD) % MOD;
}
int main()
{
long long int n, put;
fin >> n >> put;
fout << ridica(n, put);
return 0;
}