Pagini recente » Cod sursa (job #1998910) | Cod sursa (job #858196) | Cod sursa (job #1293939) | Cod sursa (job #1250150) | Cod sursa (job #2203889)
#include <bits/stdc++.h>
using namespace std;
long long int a,n;
void gcd (long long &x, long long &y, int A ,int B)
{
if (!b)
{
x=1;
y=0;
}
else
{
gcd(x,y,b,A%B);
long long aux=x;
x=y;
y=aux-y*(A/B);
}
}
int main()
{
ifstream fin ("inversmodular.in");
ofstream fout ("inversmodular.out");
fin>>a>>n;
long long int inv=0,ins;
gcd(inv,ins,a,n);
if (inv<=0)
{
inv=n+inv%n;
}
fout<<"\n"<<inv;
}