Cod sursa(job #3134590)
Utilizator | Data | 29 mai 2023 19:05:25 | |
---|---|---|---|
Problema | Invers modular | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("inversmodular.in");
ifstream fout ("inversmodular.out");
int a,n,x, y, x0, y0, c;
void euclid( int a, int b, int &x, int &y )
{
if(b==0)
{
x=1;
y=0;
return;
}
c=a/b;
euclid(b,a%b,x0,y0);
x=y0;
y=x0-c*y0;
}
int main()
{
fin>>a>>n;
euclid(n,a,x,y);
while (y<0)
y+=n;
fout<<y;
return 0;
}