Cod sursa(job #2259537)
Utilizator | Data | 13 octombrie 2018 14:05:15 | |
---|---|---|---|
Problema | Invers modular | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
using namespace std;
int cmmdc(int a, int b,int &x,int &y) //ALGORITMUL LUI EUCLID EXTINS
{
if(b==0)
{ x=1;
y=0;
return a;
}
int d=cmmdc(b,a%b,x,y);
int xn=y;
y=x-y*(a/b);
x=xn;
return d;
}
int main()
{
ifstream cin("inversmodular.in");
ofstream cout("inversmodular.out");
int a,n,x,y;
cin>>a>>n;
cmmdc(a,n,x,y);
while(x<0) x+=n;
cout<<x%n;
return 0;
}