Cod sursa(job #2909186)
Utilizator | Data | 9 iunie 2022 19:14:16 | |
---|---|---|---|
Problema | Algoritmul lui Euclid extins | Scor | 0 |
Compilator | c-32 | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
int gcd( int &x, int &y, int a, int b )
{
int aux, y0, d;
if (!b)
{
x = 1;
y = 0;
return a;
}
d = gcd( aux, y0, b, a % b );
x = y0;
y = aux - y0 * (a / b);
return d;
}
int main()
{
fopen("euclid3.in", "rt");
fopen("euclid3.out", "wt");
int T;
int a, b, d, x, y;
scanf("%d", &T);
for (i=0;i<T;i++)
{
scanf("%d %d %d", &a, &b, &x);
d = gcd( a, b, x, y );
if (x % d != 0)
printf("0 0\n");
else
printf("%d %d\n", x * (x / d), y * (x / d));
}
return 0;
}