Pagini recente » Borderou de evaluare (job #1036586) | Cod sursa (job #2357095) | Cod sursa (job #816268) | Cod sursa (job #1880589) | Cod sursa (job #3193003)
#include <iostream>
#include <fstream>
#include <queue>
#include <vector>
using namespace std;
ifstream fin("lgput.in");
ofstream fout("lgput.out");
const int MOD = 1999999973;
int power(unsigned long long n, unsigned long long p) {
int ans = 1;
while (p) {
if ((p&1))
ans = (ans * n) % MOD;
p = (p>>1);
n = (n * n) % MOD;
}
return ans;
}
int main() {
unsigned long long n, p;
fin>>n>>p;
fout<<power(n, p);
fin.close();
fout.close();
return 0;
}