Cod sursa(job #1893308)
Utilizator | Tiberiu Raducanu Tibiraducanu | Data | 25 februarie 2017 16:41:18 |
---|---|---|---|
Problema | Invers modular | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <bits/stdc++.h>
using namespace std;
void euclid(int a, int b, int &x, int &y){
if(b==0) x=1, y=0;
else{
int x0,y0;
euclid(b,a%b,x0,y0);
x=y0;
y=x0-a/b*y0;
}
}
int main()
{
freopen("inversmodular.in","r",stdin);
freopen("inversmodular.out","w",stdout);
int a,n,x,y;
scanf("%d%d",&a,&n);
euclid(a,n,x,y);
while(x<0) x+=n;
printf("%d\n",x);
return 0;
}