Pagini recente » Cod sursa (job #2245158) | Cod sursa (job #1879174) | Cod sursa (job #3255570) | Cod sursa (job #2750809) | Cod sursa (job #2906643)
#include<iostream>
#include<set>
#include<algorithm>
#include <vector>
#include <fstream>
#include <cstring>
#include <map>
#include <math.h>
using namespace std;
const int MOD = 1999999973;
long long n, p;
int main () {
ifstream cin ("lgput.in");
ofstream cout ("lgput.out");
cin >> n >> p;
long long ans = 1;
while (p){
if (p%2==1){
ans *= n;
ans %= MOD;
}
p/=2;
n *= n;
n %= MOD;
}
cout << ans;
}