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