Pagini recente » Cod sursa (job #1708311) | Cod sursa (job #2886629) | Cod sursa (job #2613628) | Cod sursa (job #1943807) | Cod sursa (job #2449481)
#include <cstdio>
#include <iostream>
using namespace std;
typedef long long ll;
ll g;
pair <ll, ll> gcd(ll a, ll b) {
if (b == 0) {
g = a;
return {1, 0};
} else {
pair <ll, ll> aux = gcd(b, a % b);
return {aux.second, aux.first - (ll)a / b * aux.second};
}
}
int main() {
freopen ("euclid3.in","r",stdin);
freopen ("euclid3.out","w",stdout);
int t;
cin >> t;
while (t--) {
ll a, b, c;
cin >> a >> b >> c;
pair <ll, ll> aux = gcd(a, b);
if (c % g)
cout << "0 0\n";
else
cout << aux.first*(c / g) << " " << aux.second*(c / g) << "\n";
}
return 0;
}