Pagini recente » Cod sursa (job #1623826) | Cod sursa (job #2501957) | Cod sursa (job #2347019) | Rating Razvan Boicu (snkwtf112) | Cod sursa (job #1193605)
#include <fstream>
using namespace std;
ifstream cin("inversmodular.in");
ofstream cout("inversmodular.out");
void Euclid(const int A, const int B, int &X, int &Y)
{
if (B == 0)
{
X = 1;
Y = 0;
return;
}
int X0, Y0;
Euclid(B, A % B, X0, Y0);
X = Y0;
Y = X0 - (A / B) * Y0;
}
int InvMod(const int A, const int N)
{
int x, y;
Euclid(A, N, x, y);
if (x < 0)
x = N + x % N;
return x;
}
int main()
{
int A, N;
cin >> A >> N;
cout << InvMod(A, N);
cin.close();
cout.close();
}