Pagini recente » Cod sursa (job #300442) | Cod sursa (job #1665515) | Cod sursa (job #578523) | Cod sursa (job #885211) | Cod sursa (job #1735423)
#include <iostream>
#include <fstream>
using namespace std;
long long mod=1999999973;
long long power(long long n,long long p) {
long long half,x=x;
if (p==0 || n==0)
return 1;
if (p%2==0) {
half=power(n,p/2);
return (half*half)%mod;
}
else {
half=power(n,(p-1)/2);
return (n*half*half)%mod;
}
}
int main() {
long long n,p;
ifstream in("lgput.in");
ofstream out("lgput.out");
in>>n>>p;
out<<power(n,p);
}