Pagini recente » Cod sursa (job #1564255) | Cod sursa (job #1122636) | Cod sursa (job #1992427) | Cod sursa (job #1890723) | Cod sursa (job #2282810)
#include <bits/stdc++.h>
using namespace std;
ifstream in("lgput.in");
ofstream out("lgput.out");
int main()
{
long long i, n,p,n1,n2,l=1999999973;
in >> n >> p; n2=n;
n1 = n;
if(p%2==0)
{
n1=n1*n1;
n=n1;
for(i = 2; i <= p/2; ++i)
{
n = n * n1;
}
}
else
{
n1=n1*n1;
for(i = 2; i <= (p-1)/2; ++i)
{
n = n * n1;
}
n=n*n1;
}
if(p==1)
n=n2;
else
if(p==0)
n=1;
out<<n%l;
return 0;
}