Cod sursa(job #2471205)
| Utilizator | Data | 10 octombrie 2019 16:20:20 | |
|---|---|---|---|
| Problema | Invers modular | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("inversmodular.in");
ofstream fout ("inversmodular.out");
long long gcd(long long a, long long b, long long & x, long long & y) {
if(b == 0) {
x = 1;
y = 0;
return a;
}
long long x1, y1;
long long d = gcd(b, a % b, x1, y1);
y = x1 - (a / b) * y1;
x = y1;
return d;
}
int main()
{
ios::sync_with_stdio(false);
fin.tie(0);
long long a, n, x, y;
fin >> a >> n;
gcd(a, n, x, y);
x = (x + n) % n;
fout << x;
return 0;
}
