Pagini recente » Cod sursa (job #1066233) | Cod sursa (job #2599500) | Cod sursa (job #2907267) | Cod sursa (job #2722626) | Cod sursa (job #2784287)
#include <fstream>
using namespace std;
ifstream f ("euclid3.in");
ofstream g ("euclid3.out");
long long t, a, b, c;
void euclid (long long a, long long b, long long &d, long long &k, long long &l)
{
if(b==0)
{
k=1;
l=0;
d=a;
return;
}
long long K, L;
euclid(b, a%b, d, K, L);
k=L;
l=K-L*(a/b);
}
int main()
{
f>>t;
for(int i=1; i<=t; i++)
{
f>>a>>b>>c;
long long d, k, l, x, y;
euclid(a, b, d, k, l);
if(c%d)
g<<"0 0\n";
else
{
x=k*c/d;
y=l*c/d;
g<<x<<" "<<y<<"\n";
}
}
return 0;
}