Pagini recente » Cod sursa (job #51299) | Cod sursa (job #2663441) | Cod sursa (job #285086) | Cod sursa (job #249830) | Cod sursa (job #1375199)
#include <cstring>
#include <fstream>
#include <algorithm>
using namespace std;
int T;
int gcd(int a, int b)
{
if (b == 0) return a;
return gcd(b, a % b);
}
pair<int, int> gcex(int a, int b, int c)
{
if (b == 0)
return make_pair(c, 0);
pair<int, int> old = gcex(b, a % b, c);
return make_pair(old.second, old.first - (a / b) * old.second);
}
int main()
{
ifstream fin("euclid3.in");
ofstream fout("euclid3.out");
fin >> T;
while (T--)
{
int A, B, C;
fin >> A >> B >> C;
int D = gcd(A, B);
if (C % D != 0)
fout << 0 << ' ' << 0 << '\n';
else
{
A /= D;
B /= D;
C /= D;
pair<int, int> res = gcex(A, B, C);
fout << res.first << ' ' << res.second << '\n';
}
}
fin.close();
fout.close();
}