Pagini recente » Cod sursa (job #1028498) | Cod sursa (job #174178) | Cod sursa (job #2844172) | Cod sursa (job #2788441) | Cod sursa (job #1165207)
#include <cstdio>
#include <algorithm>
using namespace std;
int T;
int A, B, C;
void gcd(int a, int b, int& xn, int& yn, int& d)
{
if (b == 0)
{
xn = 1;
yn = 0;
d = a;
return;
}
gcd(b, a % b, xn, yn, d);
int oxn = xn, oyn = yn;
xn = oyn;
yn = oxn - oyn * (a / b);
}
int main()
{
freopen("euclid3.in", "r", stdin);
freopen("euclid3.out", "w", stdout);
scanf("%d", &T);
while (T--)
{
scanf("%d %d %d", &A, &B, &C);
int xn, yn, D;
gcd(A, B, xn, yn, D);
if (C % D != 0) printf("0 0\n");
else printf("%d %d\n", xn * (C / D), yn * (C / D));
}
}