Pagini recente » Cod sursa (job #680286) | Cod sursa (job #1410595) | Cod sursa (job #2554804) | Cod sursa (job #3182398) | Cod sursa (job #2909882)
#include <fstream>
using namespace std;
int mod = 1999999973;
long long int a(long long int n,long long int p){
if(p==0)
return 1;
int x = a(n, p / 2);
if(p%2==0){
return ((long long)x * x)%mod;
}else{
return ((((long long)x * x)%mod) * n) %mod;
}
}
int main(){
ifstream cin("lgput.in");
ofstream cout("lgput.out");
long long int n, p;
cin >> n >> p;
cout << a(n, p);
return 0;
}