Pagini recente » Cod sursa (job #288419) | Cod sursa (job #237057) | Cod sursa (job #2592502) | Cod sursa (job #2402529) | Cod sursa (job #3164931)
#include <bits/stdc++.h>
#include <fstream>
#define int long long
using namespace std;
void invmod(int a, int b, int &d, int &x, int &y)
{
if(b==0)
{
d=a;
x=1;
y=0;
}
else
{
int x0, y0;
invmod(b, a%b, d, x0, y0);
x=y0;
y=x0-(a/b)*y0;
}
}
int32_t main()
{
ifstream cin("inversmodular.in")
ofstream cout("inversmodular.out")
int a,n,b,x,c;
cin>>a>>n;
invmod(a,n,b,x,c);
if(x<0)
x+=n;
cout<<x;
return 0;
}