Cod sursa(job #2787120)
| Utilizator | Data | 22 octombrie 2021 16:47:15 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid extins | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("euclid3.in");
ofstream fout("euclid3.out");
void GCD(int a, int b, int& d, int& x, int& y)
{
if (!b)
{
d = a;
return;
}
int x0, y0;
GCD(b, a % b, d, x0, y0);
x = y0;
y = x0 - (a / b) * y0;
}
int main()
{
int T; fin >> T;
for (int i = 1, a, b, c, d, x = 1, y = 0; i <= T; ++i)
{
fin >> a >> b >> c;
GCD(a, b, d, x, y);
if (c % d) fout << '0 0\n';
else fout << x * (c / d) << ' ' << y * (c / d) << '\n';
}
return 0;
}