Pagini recente » Cod sursa (job #2917349) | Cod sursa (job #1602402)
#include <fstream>
#define MODULO 1999999973
using namespace std;
//calc n^p
long long int n, p, sol;
void read();
long long int exp (int, int);
void result();
int main(){
read();
sol=exp (n, p);
result();
return 0;
}
void read(){
ifstream fin ("lgput.in");
fin>>n>>p;
fin.close();
return;
}
long long int exp (int n, int p){
long long int rez;
if (p==0) return 1;
if (p==1) return n;
if (p%2){
rez=exp (n, (p-1)/2)%MODULO;
rez*=rez; rez%=MODULO;
rez*=n; rez%=MODULO;
}
else{
rez=exp (n, p/2)%MODULO;
rez*=rez; rez%=MODULO;
}
return rez;
}
void result(){
ofstream fout ("lgput.out");
fout<<sol<<"\n";
fout.close();
return;
}