Cod sursa(job #3300837)
| Utilizator | Data | 19 iunie 2025 13:58:35 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid extins | Scor | 20 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include <bits/stdc++.h>
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-(a/b)*y0;
return d;
}
int main()
{
int t;
fin >> t;
for (; t; t--)
{
int a, b, c;
fin >> a >> b >> c;
int x, y;
int d=gcd(a,b,x,y);
if (c%d!=0)
fout << 0 << '\n';
else
fout << x*(c/d) << " " << y*(c/d) << '\n';
}
return 0;
}
