Cod sursa(job #3327636)
| Utilizator | Data | 4 decembrie 2025 17:30:35 | |
|---|---|---|---|
| Problema | Invers modular | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
using namespace std;
void euclid(long long a, long long b, long long &x, long long &y)
{
if (b == 0)
{
x=1;
y=1;
}
else
{
long long x1, y1;
euclid(b, a%b, x1, y1);
x=y1;
y=x1-(a/b)*y1;
}
}
int main()
{
long long a, n;
cin >> a >> n;
long long x, y;
euclid(a, n, x, y);
x=(x%n+n)%n;
cout << x;
return 0;
}
