Mai intai trebuie sa te autentifici.
Cod sursa(job #2928653)
| Utilizator | Data | 23 octombrie 2022 16:46:07 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid extins | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
using namespace std;
void euclid(int a, int b, int &d, int &x, int &y)
{
if(b == 0)
{
d = a;
x = 1;
y = 0;
}
else
{
int x0, y0;
euclid(b, a % b, d, x0, y0);
x = y0;
y = x0 - (a / b) * y0;
}
}
int main()
{
ifstream fin("inversmodular.in");
ofstream fout("inversmodular.out");
int n, a, x, y, d;
fin >> a >> n;
euclid(a, n, d, x, y);
while(x < 0)
{
x += n;
}
fout << x;
return 0;
}
