Pagini recente » Cod sursa (job #466398) | Borderou de evaluare (job #2636344) | Cod sursa (job #136498) | Cod sursa (job #2803515) | Cod sursa (job #1248434)
#include<iostream>
#include<fstream>
using namespace std;
const long long maxim = 1999999973;
int main(){
ifstream f("lgput.in", ios::in);
ofstream g("lgput.out", ios::out);
long long N, P, prod = 1;
f >> N >> P;
while (P >= 1){
if(P%2==1){
prod = (prod*N)%maxim;
}
N = (N*N)%maxim;
P /= 2;
}
g << prod << '\n';
f.close();
g.close();
return 0;
}