Cod sursa(job #454720)
Utilizator | Data | 12 mai 2010 12:31:26 | |
---|---|---|---|
Problema | Algoritmul lui Euclid extins | Scor | 100 |
Compilator | c | Status | done |
Runda | Arhiva educationala | Marime | 0.65 kb |
#include<stdio.h>
long t,i,a,b,c,d,x,y;
long euclid(long a,long b, long *x,long *y)
{
if (b==0)
{
*x=1;
*y=0;
return a;
}
long x0,y0,d;
d=euclid(b,a%b,&x0,&y0);
*x=y0;
*y=x0-(a/b)*y0;
return d;
}
int main()
{
freopen("euclid3.in","r",stdin);
freopen("euclid3.out","w",stdout);
scanf("%li",&t);
for(i=1;i<=t;++i)
{
scanf("%li%li%li\n",&a,&b,&c);
d=euclid(a,b,&x,&y);
if (c%d) printf("0 0\n");
else printf("%li %li\n",x*(c/d),y*(c/d));
}
return 0;
}