Cod sursa(job #2565287)
| Utilizator | Data | 2 martie 2020 13:22:29 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid extins | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <fstream>
using namespace std;
ifstream fin("euclid3.in");
ofstream fout("euclid3.out");
int GCD(int a, int b, int &x, int &y)
{
if(b == 0)
{
x = 1, y = 0;
return a;
}
int x0, y0;
int d = GCD(b, a % b, x0, y0);
x = y0;
y = (x0 - y0 * (a / b));
return d;
}
int main()
{
int T; fin >> T;
while(T--)
{
int a, b, c, x, y;
fin >> a >> b >> c;
int d = GCD(a, b, x, y);
if(c % d)
fout << 0 << ' ' << 0 << '\n';
else
fout << x * (c / d) << ' ' << y * (c / d) << '\n';
}
return 0;
}
