Cod sursa(job #2481943)
Utilizator | Data | 27 octombrie 2019 16:57:33 | |
---|---|---|---|
Problema | Algoritmul lui Euclid extins | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.61 kb |
#include <cstdio>
using namespace std;
int n, a, b, c, d, x, y, xn, yn;
int euclid(int a, int b, int &x, int &y)
{
if(b==0)
{
x=1;
y=0;
return a;
}
int xn=0, yn=0, dn=0;
dn=euclid(b, a%b, xn, yn);
x=yn;
y=xn-yn*(a/b);
return dn;
}
int main()
{
freopen("euclid3.in","r",stdin);
freopen("euclid3.out","w",stdout);
scanf("%d",&n);
for(int i=1;i<=n;++i)
{
scanf("%d%d%d",&a,&b,&c);
d=euclid(a, b, x, y);
if(c%d!=0)
printf("0 0\n");
else
printf("%d %d\n",x*(c+d),y/(c+d));
}
return 0;
}