Pagini recente » Cod sursa (job #2433384) | Cod sursa (job #1844509) | Cod sursa (job #1659948) | Cod sursa (job #1716404) | Cod sursa (job #743541)
Cod sursa(job #743541)
#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;
if(n==0) return 1;
if(n%2==0){
put=putere(a,p,n/2)*putere(a,p,n/2);
put%=p;
return put;
}
put=a*putere(a,p,(n-1)/2)*putere(a,p,(n-1)/2);
put%=p;
return put;
}
int main()
{
freopen("lgput.in","r",stdin);
freopen("lgput.out","w",stdout);
cin>>a>>n;
cout<<putere(a,1999999973,n);
return 0;
}