Pagini recente » Cod sursa (job #214864) | Cod sursa (job #1683732) | Statistici FMI - Ratoiu Mihai Andrei (mikanter) | Cod sursa (job #1683032) | Cod sursa (job #3141519)
#include <fstream>
#include <iostream>
#include <algorithm>
#define MOD 1999999973
using namespace std;
long long power(long long n, long long p) {
if (p == 1)
return n;
else if(p == 0)
return 1;
long long x = power(n, p / 2);
if (p % 2 == 0)
return x * x % MOD;
else
return x * x % MOD * n % MOD;
}
int main() {
/*ifstream cin("lgput.in");
ofstream cout("lgput.out");*/
int n, p;
cin >> n >> p;
cout << power(n, p);
return 0;
}