Cod sursa(job #3369588)
| Utilizator | Data | 21 octombrie 2026 10:44:16 | |
|---|---|---|---|
| Problema | Combinari | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
using namespace std;
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 g = gcd(b, a % b, x1, y1);
x = y1;
y = x1 - (a / b) * y1;
return g;
}
int main() {
long long a, n;
cin >> a >> n;
long long x, y;
gcd(a, n, x, y);
long long inv = (x % n + n) % n;
cout << inv;
return 0;
}
