Pagini recente » Cod sursa (job #1402045) | Cod sursa (job #917282) | Cod sursa (job #1773178) | Rating Dragomirescu Liviu (LiviuD2000) | Cod sursa (job #2029754)
#include <fstream>
using namespace std;
ifstream in ("inversmodular.in");
ofstream out ("inversmodular.out");
long long expow(long long b,long long e,long long mod)
{
long long ans(1);
for(int bit=0;(1<<bit)<=e;bit++)
{
if(e&(1<<bit))
ans=ans*b%mod;
b=b*b%mod;
}
return ans;
}
int main()
{
int a,n;
in>>a>>n;
out<<expow(a,n-2,n);
return 0;
}