Pagini recente » Euro2 | Profil manutruta | Istoria paginii utilizator/rondojim | Monitorul de evaluare | Cod sursa (job #3288540)
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1999999973;
long long pow(int n, int p)
{
if(p == 0)
{
return 1;
}
if((p & 1))
{
return (n * pow(n, p - 1)) % MOD;
}
else
{
long long x = pow(n, (p >> 1));
return (x * x) % MOD;
}
}
int main()
{
freopen("lgput.in", "r", stdin);
freopen("lgput.out", "w", stdout);
cin.tie(nullptr)->sync_with_stdio(false);
long long n, p;
cin >> n >> p;
cout << pow(n, p);
}