Pagini recente » Cod sursa (job #247295) | Cod sursa (job #393917) | Cod sursa (job #1577196) | Cod sursa (job #1748121) | Cod sursa (job #1376516)
#include <iostream>
#include <fstream>
#define mod 1999999973
using namespace std;
long long res;
int x;
long long power(long long n, long long p)
{
if(p==0)
return 1;
if(p==1)
return n;
if(p%2==0)
return power((n%mod)*(n%mod)%mod, p/2)%mod;
else
return n*power((n%mod)*(n%mod)%mod, (p-1)/2)%mod;
}
int main()
{
ifstream in("lgput.in");
ofstream out("lgput.out");
long long n, p;
in>>n;
x=n;
in>>p;
res=power(n, p);
out<<res<<"\n";
return 0;
}