Pagini recente » Cod sursa (job #1311182) | Cod sursa (job #2773155) | Cod sursa (job #1348795) | Cod sursa (job #499222) | Cod sursa (job #1515199)
#include <cstdio>
#include <algorithm>
using namespace std;
long long int cmmdc(long long int a, long long int b, long long int &x, long long int &y)
{
if (b == 0){
x = 1;
y = 0;
return a;
}
long long int x0, y0;
long long int d = cmmdc(b, a%b, x0, y0);
x = y0;
y = x0 - (a/b) * y0;
return d;
}
int main()
{
int n;
long long int a, b, c, d, x, y;
freopen("euclid3.in", "r", stdin);
freopen("euclid3.out", "w", stdout);
scanf("%d\n", &n);
for (int i = 1; i <= n; ++i){
scanf("%lld %lld %lld\n", &a, &b, &c);
d = cmmdc(a, b, x, y);
if (c%d != 0){
printf("0 0\n");
continue;
}
printf("%lld %lld\n", x*c/d, y*c/d);
}
return 0;
}