Pagini recente » Cod sursa (job #2087731) | Cod sursa (job #1785696) | Cod sursa (job #2077316) | Cod sursa (job #1513104) | Cod sursa (job #2973201)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("inversmodular.in");
ofstream fout("inversmodular.out");
int A,n;
void euclid(int a, int b, int &x, int &y)
{
if (b == 0) {
x = 1;
y = 0;
} else {
int x0, y0;
euclid(b, a % b, x0, y0);
x = y0;
y = x0 - (a / b) * y0;
}
}
int main()
{
fin>>A>>n;
int x,y;
euclid(A,n,x,y);
if(x<=0)
{
x=n+x%n;
}
fout<<x;
return 0;
}