Cod sursa(job #2910298)
| Utilizator | Data | 19 iunie 2022 01:52:05 | |
|---|---|---|---|
| Problema | Invers modular | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
ifstream fin("euclid3.in");
ofstream fout("euclid3.out");
int eucl_ext(int a, int n, long long& x, long long& y)
{
if (n == 0)
{
x = 1;
y = 0;
}
else
{
eucl_ext(n, a % n, x, y);
long long temp = y;
y = x - y * (a / n);
x = temp;
}
return (x >= 0) ? x : n + x % n;
}
int main()
{
int a, n;
long long x, y;
fin >> a >> n;
eucl_ext(a, n, x, y);
fout << x << ' ' << y;
}
