Cod sursa(job #763524)
| Utilizator | Data | 2 iulie 2012 15:31:43 | |
|---|---|---|---|
| Problema | Invers modular | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <cstdio>
#include <algorithm>
using namespace std;
void euclid(int a,int b,int &d,int &x,int &y){
if(b==0)
{
x=1;
y=0;
d=a;
return ;
}
int x0,y0;
euclid(b,a%b,d,x0,y0);
x=y0;
y=x0-a/b*y0;
}
int main(){
int a,b,d,x,y;
freopen("inversmodular.in","r",stdin);
freopen("inversmodular.out","w",stdout);
scanf("%d %d",&a,&b);
euclid(a,b,d,x,y);
if(x<0)x += (x/n+1)*n;
printf("%d\n",x);
return 0;
}
