Cod sursa(job #1528379)
Utilizator | Data | 19 noiembrie 2015 16:58:41 | |
---|---|---|---|
Problema | Invers modular | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <cstdio>
using namespace std;
int a,b,d,x,y;
inline void euclid(int a,int b)
{
if(b==0)
{
x=1;
y=0;
return;
}
euclid(b,a%b);
int x0=x;
x=y;
y=x0-(a/b)*y;
}
int main()
{
freopen("inversmodular.in","r",stdin);
freopen("inversmodular.out","w",stdout);
scanf("%d%d",&a,&b);
euclid(a,b);
while(x<0) x+=b;
printf("%d\n",x);
return 0;
}