Pagini recente » Cod sursa (job #1657027) | Cod sursa (job #1071451) | Cod sursa (job #82472) | Cod sursa (job #2644048) | Cod sursa (job #1037900)
#include <iostream>
#include <stdio.h>
using namespace std;
long long pow(long long n,int p)
{
if(p==0)
return n;
n=(n*n)%10000000000;
p-=2;
pow(n,p);
}
int main()
{
long long n,p;
long long result;
freopen("lgput.in","r",stdin);
freopen("lgput.out","w",stdout);
cin>>n>>p;
if(p%2==0)
{result=pow(n,p)%1999999973;
cout<<result;}
else{
result=(n*pow(n,p))%1999999973;
cout<<result;}
return 0;
//1127918673
}