Pagini recente » Cod sursa (job #627124) | Cod sursa (job #1925998) | Cod sursa (job #1631014) | Cod sursa (job #2171508) | Cod sursa (job #719842)
Cod sursa(job #719842)
#include <fstream>
#define MOD 1999999973
using namespace std;
ifstream f("lgput.in");
ofstream g("lgput.out");
long long n;
int p;
void citeste(){
f >> n >> p;
}
void putere(){
long long rez = 1;
while(p){
if (p % 2 == 1)
rez = (rez * n) % MOD;
n=(n*n) % MOD;
p /= 2;
}
/*
for(int i=0; (1<<i) <= p; i++){
if ( ((1<<i) & p) > 0)
rez = (rez * n) % MOD;
n = (n*n) % MOD;
}
*/
g << rez % MOD << "\n";;
}
int main(){
citeste();
putere();
f.close();
g.close();
return 0;
}