Pagini recente » Cod sursa (job #1791312) | Monitorul de evaluare | Diferente pentru preoni-2008 intre reviziile 24 si 20 | Cod sursa (job #2615126) | Cod sursa (job #2032692)
#include <stdio.h>
#define ll long long
const ll mod = 1999999973;
ll p(ll x,ll n)
{
ll rez = 1;
ll pow = x;
for(int i = 0;i<32;i++,pow=(pow*pow)%mod)
if((1<<i) & n)
rez = (rez * pow) % mod;
return rez;
}
ll n,p;
int main()
{
fscanf(fopen("lgput.in","r"),"%lld%lld",&n,&p);
fprintf(fopen("lgput.out","w"),"%lld",p(n,p));
return 0;
}