Pagini recente » Cod sursa (job #2399231) | Cod sursa (job #1570174) | Borderou de evaluare (job #1556218) | Cod sursa (job #1004864) | Cod sursa (job #1059403)
#include<fstream>
using namespace std;
const int mod = 1999999973;
int main() {
ifstream fin("lgput.in");
ofstream fout("lgput.out");
long long n, p, aux = 1;
fin >> n >> p;
while(p > 1) {
if(p % 2 == 1) {
aux *= n;
aux %= mod;
n *= n;
n %= mod;
p = (p-1)/2;
} else {
n *= n;
n %= mod;
p /= 2;
}
}
n *= aux;
n %= mod;
fout << n;
return 0;
}