Pagini recente » Cod sursa (job #2764995) | Cod sursa (job #1370403) | Cod sursa (job #850144) | Cod sursa (job #2267320) | Cod sursa (job #743549)
Cod sursa(job #743549)
#include <iostream>
#include<cstdio>
using namespace std;
long int a,n;
long int putere(long int a,long int p, long int n)
{
long int put,aux;
if(n==0) return 1;
if(n%2==0){
aux=(putere(a,p,n/2)%p);
put=aux*aux;
put%=p;
return put;
}
else{
aux=(putere(a,p,(n-1)/2)%p);
put=a*((aux*aux)%p);
put%=p;
return put;
}
}
int main()
{
freopen("lgput.in","r",stdin);
freopen("lgput.out","w",stdout);
cin>>a>>n;
a%=1999999973;
cout<<putere(a,1999999973,n);
return 0;
}