Pagini recente » Borderou de evaluare (job #1262507) | Statistici joker (AbRaCaDaBrA) | Borderou de evaluare (job #2421980) | Profil phanthom | Cod sursa (job #2124703)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("lgput.in");
ofstream fout("lgput.out");
const int MOD = 1999999973;
int a, n;
inline int Pow(int a, int n)
{
int p = 1;
while(n > 0)
{
if(n % 2 == 1)
p = (1ll * p * a) % MOD;
n /= 2;
a = (1LL * a * a) % MOD;
}
return p;
}
int main()
{
fin >> a >> n;
fout << Pow(a, n);
return 0;
}