Cod sursa(job #2515954)
| Utilizator | Data | 29 decembrie 2019 20:54:26 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid extins | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
#include <iostream>
using namespace std;
ifstream fin("euclid3.in");
ofstream fout("euclid3.out");
int euclid(int a, int b, int &x, int &y){
if (!b){
x=1;
y=0;
return a;
}
int d, x0, y0;
d=euclid(b, a%b, x0, y0);
x=y0;
y=x0-(a/b)*y0;
return d;
}
int main(){
int n, i, a, b, c, x, y, d;
fin>>n;
while (n--){
fin>>a>>b>>c;
d=euclid(a, b, x, y);
if (c%d)
fout<<"0 0\n";
else
fout<<x*(c/d)<<" "<<y*(c/d)<<'\n';
}
fin.close();
fout.close();
return 0;
}