Cod sursa(job #1892660)
| Utilizator | Data | 25 februarie 2017 10:47:27 | |
|---|---|---|---|
| Problema | Invers modular | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <iostream>
#include <cstdio>
using namespace std;
int n, a, b, c, k, l;
void EuclidExtins(int a, int b, int &k, int &l)
{
if(b==0)
k=1, l=0;
else
{
int kp, lp;
EuclidExtins(b, a%b, kp, lp);
k=lp;
l=kp-lp*(a/b);
}
}
int main()
{
freopen("inversmodular.in", "r", stdin);
freopen("inversmodular.out", "w", stdout);
cin>>a>>b;
EuclidExtins(a, b, k, l);
if(k<=0){
k=b+k%b;
}
cout<<k;
return 0;
}
