Pagini recente » Cod sursa (job #1582444) | Cod sursa (job #1551479) | Cod sursa (job #2481140) | Cod sursa (job #1260857) | Cod sursa (job #1654071)
#include <algorithm>
#include <bitset>
#include <cmath>
#include <fstream>
#include <iostream>
#include <queue>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
ifstream fin ("lgput.in");
ofstream fout ("lgput.out");
const int MOD = 1999999973;
ll go(ll a, int p) {
if (p == 0)
return 1;
ll res = go((a*a) % MOD, p/2);
if (p & 1)
res = (res * a) % MOD;
return res;
}
int main() {
int N, P;
fin >> N >> P;
fout << go(N, P) << endl;
return 0;
}