Pagini recente » Cod sursa (job #2751601) | Cod sursa (job #2294931) | Cod sursa (job #2142221) | Cod sursa (job #2765385) | Cod sursa (job #2038928)
#include <cstdio>
#include <iostream>
using namespace std;
long long n, k, l, d;
pair <long long, long long> euclid(long long x, long long y)
{
if(y == 0)
{
d = x;
return {1,0};
}
auto p = euclid(y, x%y);
return {p.second, p.first - (x/y) * p.second};
}
int main()
{
freopen("euclid3.in", "r", stdin);
freopen("euclid3.out", "w", stdout);
scanf("%lld", &n);
for(int i = 0; i < n; i++)
{
long long a, b, c;
scanf("%lld %lld %lld", &a, &b, &c);
pair <long long, long long> rez = euclid(a,b);
// printf("%lld %lld\n", rez.first, rez.second);
if(c%d == 0)
{
printf("%lld %lld\n", rez.first * (c/d), rez.second * (c/d));
}
else
printf("0 0\n");
}
return 0;
}