Pagini recente » Cod sursa (job #2592696) | Cod sursa (job #1394349) | Cod sursa (job #736001) | Cod sursa (job #618023) | Cod sursa (job #3161659)
#include <fstream>
using namespace std;
ifstream cin("euclid3.in");
ofstream cout("euclid3.out");
void gcd(long long a, long long b, long long& d, long long& k, long long& l)
{
if (!b)
{
d = a;
k = 1;
l = 0;
}
else
{
long long lnou, knou;
gcd(b, a % b, d, knou, lnou);
k = lnou;
l = knou - (a / b) * lnou;
}
}
int main()
{
long long t, a, b, c;
cin >> t;
for (int i = 0; i < t; i++)
{
cin >> a >> b >> c;
long long k, l, d;
gcd(a, b, d, k, l);
if (c % d == 0)
cout << k * c / d << ' ' << l * c / d << '\n';
else
cout << 0 << ' ' << 0 << '\n';
}
return 0;
}