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