Pagini recente » Cod sursa (job #2706310) | Cod sursa (job #41496) | Cod sursa (job #2612516) | Cod sursa (job #886859) | Cod sursa (job #2159521)
#include <bits/stdc++.h>
#define mod 224737
using namespace std;
int rid(int x,int y)
{
if(y==1) return x %mod;
if(y%2==0) return ((rid(x,y/2)%mod) * (rid(x,y/2))%mod) %mod;
if(y%2==1) return ((rid(x,y/2)%mod) * (rid(x,y/2)%mod) * x )%mod;
}
int fact(int n)
{
int s=1;
for(int i=2; i<=n; ++i)
{
s=(s*i)%mod;
}
return s;
}
int main()
{
ifstream f("inversmodular.in");
ofstream g("inversmodular.out");
long long a,n;
f>>a>>n;
g<<rid(a,n-2);
return 0;
}