Pagini recente » Cod sursa (job #2964374) | Cod sursa (job #1432687) | Cod sursa (job #1021848) | Cod sursa (job #2594628) | Cod sursa (job #2485042)
#include <fstream>
#include <cmath>
using namespace std;
ifstream cin("euclid2.in");
ofstream cout("euclid2.out");
pair<long long int, long long int> euclide(long long int a, long long int b) {
if (b == 0) {
return {1, 0};
} else {
pair<long long int, long long int> r = euclide(b, a % b);
return {r.second, r.first - (a/b)*r.second};
}
}
long long int euclid(long long int a, long long int b) {
while(a && b) {
if(abs(a) > abs(b)) {
a %= b;
} else
b %= a;
}
if(a == 0)
return b;
else
return a;
}
int main() {
long long int t;
cin>>t;
while(t--) {
long long int a, b, c, d;
cin>>a>>b>>c;
d = euclid(a, b);
pair<long long int, long long int> tmp = euclide(a, b);
if(c % d){
cout<<"0 0\n";
continue;
}
long long int tmp1 = c/d;
cout<<tmp.first*tmp1<<' '<<tmp.second*tmp1<<'\n';
}
return 0;
}