Cod sursa(job #2195683)
| Utilizator | Data | 17 aprilie 2018 10:08:51 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid extins | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ifstream in("euclid3.in");
ofstream out("euclid3.out");
int t;
ll a, b, c, d, x, y;
void gcd(ll a, ll b, ll &d, ll &x, ll &y){
if(b == 0){
d = a;
x = 1;
y = 0;
} else {
ll xx, yy;
gcd(b, a % b, d, x, y);
x = yy;
y = xx - yy * (a / b);
}
}
int main(){
in >> t;
while(t--){
in >> a >> b >> c;
x = y = d = 0;
gcd(a, b, d, x, y);
if(c % d){
out << "0 0\n";
continue;
}
out << x * (c / d) << ' ' << y * (c / d) << '\n';
}
return 0;
}
