Cod sursa(job #3369571)
| Utilizator | Data | 21 octombrie 2026 10:14:01 | |
|---|---|---|---|
| Problema | Invers modular | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
using namespace std;
void euclid(int a, int b, int &x, int &y)
{
if (b==0)
{
x=1;
y=1;
}
else
{
int x1,y1;
euclid(b,a%b,x1,y1);
x=y1;
y=x1-a/b*y1;
}
}
int main()
{
int A,N,X,Y;
cin>>A>>N;
euclid(A,N,X,Y);
while(X<0)
X+=N;
cout<<X;
return 0;
}
