Pagini recente » Cod sursa (job #2054005) | Cod sursa (job #2052831) | Cod sursa (job #1112469) | Cod sursa (job #1792798) | Cod sursa (job #964553)
Cod sursa(job #964553)
#include <cstdio>
using namespace std;
long long v[35],i=0,p2[35];
bool folosit[35];
int main()
{
long long n,m,nr,rez=1,put;
freopen("lgput.in","r",stdin);
freopen("lgput.out","w",stdout);
scanf("%lld%lld",&n,&m);
p2[0]=1;
put=1;
while(put<=m)
{
i++;
put*=2;
p2[i]=put;
}
nr=i;
for(i=nr;i>=0;i--)
{
if(m>=p2[i])
{
folosit[i]=true;
m=m-p2[i];
}
}
v[0]=n;
if(folosit[0]==true)
rez=n;
for(i=1;i<=nr;i++)
{
v[i]=(v[i-1]*v[i-1])%1999999973;
if(folosit[i]==true)
rez=(rez*v[i])%1999999973;
}
printf("%d\n",rez);
return 0;
}