Pagini recente » Cod sursa (job #1399376) | Cod sursa (job #2988754) | Cod sursa (job #2382997) | Cod sursa (job #1154057) | Cod sursa (job #1787006)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fi("lgput.in");
ofstream fo("lgput.out");
int n,i,k=1,m;
long long M=1999999973;
long long p=1;
int power(int n,int k)
{
if(k==0) return 1;
else
if(k==1)
return n%M;
else
{if(k%2==0)
return ((power(n,k/2)%M)*(power(n,k/2)%M))%M;
else
return ((n%M)*(power(n,(k-1))%M))%M;
}
}
int main()
{
fi>>n>>k;
fo<<power(n,k)%M;
}