Cod sursa(job #2784297)
| Utilizator | Data | 16 octombrie 2021 11:48:59 | |
|---|---|---|---|
| Problema | Invers modular | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
using namespace std;
typedef long long ll;
ll n, a;
pair<ll, ll> euclidExtins(ll X, ll Y) {
if(!Y) return {1, 0};
pair<ll, ll> p = euclidExtins(Y, X % Y);
return {p.second, p.first - p.second * (X / Y)};
}
int main()
{
freopen("inversmodular.in", "r", stdin);
freopen("inversmodular.out", "w", stdout);
scanf("%lld%lld", &a, &n);
printf("%lld", euclidExtins(a, n).first);
return 0;
}
