Pagini recente » Cod sursa (job #1547804) | Cod sursa (job #1028141) | Cod sursa (job #1011528) | Cod sursa (job #807628) | Cod sursa (job #1495591)
#include <iostream>
#include <cstdio>
using namespace std;
int euclid(int a, int b,int &x,int &y)
{
if(b==0)
return a;
int r = a%b;
int cmmdc = euclid(b,r,x,y);
int c = a/b;
int x_prec=x,y_prec=y;
x = y_prec;
y = x_prec - c*y_prec;
return cmmdc;
}
void solve(int a,int b,int c)
{
int x=1,y=0;
int d = euclid(a,b,x,y);
if(c%d)
{
printf("0 0\n");
return;
}
int div = c / d;
printf("%d %d\n",x*div,y*div);
}
int main()
{
freopen("inversmodular.in","r",stdin);
freopen("inversmodular.out","w",stdout);
int A,N;
scanf("%d%d",&A,&N);
solve(A,N,1);
return 0;
}