Cod sursa(job #996064)
Utilizator | Data | 10 septembrie 2013 23:08:33 | |
---|---|---|---|
Problema | Algoritmul lui Euclid extins | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.62 kb |
#include <cstdio>
using namespace std;
int t, a, b, c, d, x, y;
int GCD(int a, int b, int &x, int &y)
{
if( !b )
{
x=1;
y=0;
return a;
}
int d, x0, y0;
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);
scanf("%d", &t);
while( t-- )
{
scanf("%d %d %d", &a, &b, &c);
d = GCD (a, b, x, y);
if( !(c%d) )
printf("%d %d\n", x * c/d , y * c/d);
else
printf("%d %d\n", 0, 0);
}
return 0;
}