Pagini recente » Cod sursa (job #2591615) | Cod sursa (job #1803606) | Cod sursa (job #2091465) | Cod sursa (job #2700137) | Cod sursa (job #2787193)
#include <iostream>
#include <fstream>
using namespace std;
long long pow(int a, int n);
const int mod = 1999999973;
int main()
{
ifstream cin("lgput.in");
ofstream cout("lgput.out");
int a, n;
cin >> a >> n;
cout << pow(a, n);
return 0;
}
long long pow(int a, int n)
{
if(n == 1)
{
return a;
}
long long b;
b = pow(a, n/2);
if (n%2 == 0)
{
return (b*b) % mod;
}
else
{
return ((b*b) % mod) * a%mod;
}
}