Pagini recente » Cod sursa (job #2177485) | Cod sursa (job #2254330) | Cod sursa (job #1491007) | Cod sursa (job #992643) | Cod sursa (job #2946070)
#include <fstream>
#include <iostream>
using namespace std;
ifstream in("lgput.in");
ofstream out("lgput.out");
const int M=1999999973;
long long putere(long long n, long long p){
if(p==1){
return n%M;
}
if(p%2!=0){
return n%M*putere(n,p-1)%M;
}else{
return putere(n,p/2)%M*putere(n,p/2)%M;
}
}
int main()
{
long long n,p;
in>>n>>p;
out<<putere(n,p);
return 0;
}