Cod sursa(job #3298105)
| Utilizator | Data | 26 mai 2025 22:22:56 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid extins | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include <iostream>
#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) {
x = 1;
y = 0;
return a;
}
int x0,y0, d;
d = gcd(b, a % b, x0, y0);
x = y0;
y = x0 - (a / b) * y0;
return d;
}
int main() {
int n;
fin>>n;
while (n--) {
int a, b, c;
fin >> a >> b >> c;
int x, y, d;
d = gcd(a, b, x, y);
if ( c % d)
fout<< "0 0\n";
else
fout << x*(c/d) << " " << y*(c/d) << " " << endl;
}
}