Pagini recente » Cod sursa (job #867629) | Cod sursa (job #2802771) | Cod sursa (job #3205159) | Cod sursa (job #1924116) | Cod sursa (job #1008761)
#include <iostream>
#include <fstream>
#define modulo 1999999973
#define unint long long
using namespace std;
ifstream in("lgput.in");
ofstream out("lgput.out");
long long n,p;
long long putere(unint baza, unint exp){
if (exp==1) return n%modulo;
else {
long long half=putere(n, int(exp/2));
if (exp % 2 == 0) return ((half%modulo)*(half%modulo))%modulo;
else return ((((half%modulo)*(half%modulo))%modulo)*(baza%modulo))%modulo;
}
}
int main(){
in >> n >> p;
out << putere(n, p)%modulo << "\n";
return 0;
}