Pagini recente » Cod sursa (job #2431658) | Cod sursa (job #104806) | Cod sursa (job #2965987) | Cod sursa (job #1807335) | Cod sursa (job #1414138)
#include <fstream>
#include <algorithm>
using namespace std;
int T, A, B, C;
int gcd(int a, int b, int &x, int &y)
{
if (b == 0)
{
x = 1;
y = 0;
return a;
}
int xn, yn;
int res = gcd(b, a % b, xn, yn);
x = yn;
y = xn - (a / b) * yn;
return res;
}
int main()
{
ifstream fin("euclid3.in");
ofstream fout("euclid3.out");
fin >> T;
while (T--)
{
fin >> A >> B >> C;
int x, y;
int D = gcd(A, B, x, y);
if (C % D != 0)
fout << 0 << ' ' << 0 << '\n';
else
fout << x * (C / D) << ' ' << y * (C / D) << '\n';
}
fin.close();
fout.close();
}