Pagini recente » Cod sursa (job #2100694) | Cod sursa (job #3239234) | Cod sursa (job #1140200) | Cod sursa (job #1287554) | Cod sursa (job #2476402)
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll i, j, n, m , k;
ll gcd(ll a, ll b) { return __gcd(a, b); }
ll euclid(ll a, ll b, ll &x, ll &y) {
if (b) { ll d = euclid(b, a % b, y, x);
return y -= a/b * x, d; }
return x = 1, y = 0, a;
}
ifstream fin("euclid3.in");
ifstream fout("euclid3.out");
int main() {
cin.sync_with_stdio(0);
cin.tie(0);
fin>>n;
ll a, b, c;
while (n) {
fin>>a>>b>>c;
ll d = gcd(a, b);
// cout<<d<<" : "<<gcd(a*c/d, b*c/d)<<endl;
if (c % d != 0) {
fout<<0<<" "<<0<<"\n";
}
else {
ll x, y;
a = a * c / d;
b = b * c / d;
euclid(a, b, x, y);
x = x * c / d;
y = y * c / d;
fout<<x<<" "<<y<<"\n";
}
n--;
}
return 0;
}