Pagini recente » Cod sursa (job #431461) | Cod sursa (job #480224) | Cod sursa (job #1051961) | Cod sursa (job #1429264) | Cod sursa (job #1046399)
#include<fstream>
#define MOD 1999999973
using namespace std;
long long ridicaLaPutere(long long n, long long b){
n = n%MOD;
if (b < 0){
return ridicaLaPutere(1 / n, -b)%MOD;
}
else if (b == 0){
return 1;
}
else if (b == 1){
return n;
}
else if (b % 2 == 0){
return ridicaLaPutere((n*n)%MOD, b/2)%MOD;
}
else {
return ridicaLaPutere((n*n)%MOD, (b - 1) / 2)%MOD;
}
}
int main(){
ifstream f("lgput.in");
long long n, p;
f >> n >> p;
ofstream cout("lgput.out");
cout << ridicaLaPutere(n, p)%MOD;
}