Pagini recente » Cod sursa (job #1059280) | Cod sursa (job #2332883) | Cod sursa (job #2057550) | Cod sursa (job #1832376) | Cod sursa (job #2930519)
#include <bits/stdc++.h>
using namespace std;
pair<int, int> euclid(int a, int b) {
if (!b)
return {1, 0};
pair<int, int> ans0 = euclid(b, a % b);
return {ans0.second, ans0.first - a / b * ans0.second};
}
int32_t main() {
ifstream fin("euclid3.in");
ofstream fout("euclid3.out");
int n;
fin >> n;
for (int i = 1, a, b, c; i <= n; ++i) {
fin >> a >> b >> c;
int d = __gcd(a, b);
if (c % d != 0) {
fout << "0 0\n";
continue;
}
pair<int, int> ans = euclid(a, b);
fout << ans.first * (c / d) << ' ' << ans.second * (c / d) << '\n';
}
}