Pagini recente » Cod sursa (job #113838) | Rating Egor Boaghi (Egor1991) | Cod sursa (job #1871490) | Cod sursa (job #2299902) | Cod sursa (job #3167590)
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("lgput.in");
ofstream fout ("lgput.out");
int main()
{
long long n,p,modulo = 1999999973,ans = 1;
fin >> n >> p;
while (p>0){
if (p%2==0){
n = n * n;
n = n % modulo;
p = p / 2;
}else{
p -= 1;
ans *= n;
ans = ans % modulo;
p = p / 2;
n = n * n;
n = n % modulo;
}
}
fout << ans;
return 0;
}