Pagini recente » Cod sursa (job #3240923) | Cod sursa (job #1068941) | Cod sursa (job #3349235) | Cod sursa (job #435613) | Cod sursa (job #2348951)
#include<cstdio>
long long y=1,x;
int o,l,N=1999999973,p;
char r[23];
long long A()
{
long long s=0;
for(;r[o]<'0'||r[o]>'9';o++);
for(;r[o]>='0'&&r[o]<='9';o++)
s=s*10+r[o]-'0';
return s;
}
void S(long long x)
{
int i,d=x>999999999?10:x>99999999?9:x>9999999?8:x>999999?7:x>99999?6:x>9999?5:x>999?4:x>99?3:x>9?2:1;
for(i=d-1;i>=0;x/=10,i--)
r[l+i]=x%10+48;
l+=d;
}
int main()
{
freopen("lgput.in","r",stdin),freopen("lgput.out","w",stdout),fread(r,1,100,stdin),x=A(),p=A();
for(;p;p>>=1,x=(x*x)%N)
if(p&1)
y=(x*y)%N;
S(y),fwrite(r,1,l,stdout);
}