Cod sursa(job #2327769)
| Utilizator | Data | 24 ianuarie 2019 22:15:17 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid extins | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include<bits/stdc++.h>
using namespace std;
int q,a,b,c;
int x,y;
int ext_gcd(int a, int b, int& x, int& y) {
if (b==0) {
x=1;
y=0;
return a;
}
int x0,y0;
int gcd=ext_gcd(b, a%b, x0, y0);
x=y0;
y=x0-a/b*y0;
return gcd;
}
int main() {
ifstream cin("euclid3.in");
ofstream cout("euclid3.out");
cin>>q;
while (q--) {
cin>>a>>b>>c;
int gcd=ext_gcd(a,b,x,y);
if (c%gcd) cout<<"0 0\n";
else cout<<x*(c/gcd)<<" "<<y*(c/gcd)<<'\n';
}
return 0;
}
