Pagini recente » Cod sursa (job #4031) | Cod sursa (job #2626455) | Cod sursa (job #197700) | Cod sursa (job #2849119) | Cod sursa (job #627880)
Cod sursa(job #627880)
#include <fstream>
using namespace std;
ifstream fi("lgput.in");
ofstream fo("lgput.out");
long long n,p,rez;
const long long mod=1999999973;
long long pow2(long long n,long long p)
{
if(p==0)
return 1;
else if(p%2==0)
{
return pow2((n*n)%mod,p/2)%mod;
}
else
{
return (n*pow2((n*n)%mod,(p-1)/2))%mod;
}
}
int main()
{
fi>>n>>p;
fi.close();
rez=pow2(n,p);
fo<<rez<<"\n";
fo.close();
return 0;
}