Pagini recente » Cod sursa (job #2757871) | Cod sursa (job #3184228) | Cod sursa (job #592463) | Cod sursa (job #532165) | Cod sursa (job #2627924)
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
const int mod = 1999999973;
long long ridicareLaPutere(int n, int p){
long long r = 1;
while(p > 0) {
if(p % 2 == 1)
r = r * n;
p /= 2;
r *= n;
}
return r % mod;
}
int main(){
ifstream fin("lgput.in");
ofstream fout("lgput.out");
int n, p;
fin >> n >> p;
fout << ridicareLaPutere(n, p);
return 0;
}