Cod sursa(job #260491)
Utilizator | Data | 17 februarie 2009 09:30:41 | |
---|---|---|---|
Problema | Algoritmul lui Euclid extins | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <stdio.h>
int gcd(int A,int B,int &x,int &y)
{
if (B==0)
{
x=1;
y=0;
return A;
}
int x0,y0,D;
D = gcd(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);
int n,x,y,C,x0,y0,D;
scanf("%d",&n);
while (n)
{
n--;
scanf("%d%d%d",&x,&y,&C);
D = gcd(x,y,x0,y0);
if (C%D) printf("0 0\n");
else printf("%d %d\n",x0*(C/D),y0*(C/D));
}
}