Pagini recente » Cod sursa (job #3148471) | Cod sursa (job #159046) | Cod sursa (job #2948213) | Cod sursa (job #2747877) | Cod sursa (job #2361782)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("euclid3.in");
ofstream fout("euclid3.out");
typedef long long ll;
int T,a,b,c;
int gcd( ll A, ll B, ll &X, ll &Y )
{
if (B==0)
{
X=1;
Y=0;
return A;
}
ll X0,Y0,D;
D=gcd( B, A % B, X0, Y0 );
X=Y0;
Y=X0-(A/B)*Y0;
return D;
}
int main()
{
ll x,y,d;
fin>>T;
for(int i=1;i<=T;++i)
{
fin>>a>>b>>c;
// a*x+b*y=c ;
d=gcd(a,b,x,y);
//sol daca c%d==0
if(c%d) fout<<"0 0\n";
else {
//inmultesc relatia cu c/d
fout<<x*(c/d)<<" "<<y*(c/d)<<"\n";
}
}
return 0;
}