Pagini recente » Cod sursa (job #744453) | Cod sursa (job #1494875)
///Solutie explicata de marele matematician Tudor Bonifate
#include <bits/stdc++.h>
using namespace std;
int T , a , b , c , cmmdc;
int x , y;
int Euclid(int a , int b , int &x , int &y)
{
if (!b)
{
x = 1; y = 0;
return a;
}
int x0 , y0 , d = Euclid(b , a % b , x0 , y0);
x = y0;
y = x0 - (a / b) * y0;
return d;
}
int main()
{
freopen("euclid3.in","r",stdin);
freopen("euclid3.out","w",stdout);
for (scanf("%d", &T); T; --T)
{
scanf("%d %d %d", &a, &b, &c);
cmmdc = Euclid(a , b , x , y);
if (c % cmmdc != 0)
{
printf("0 0\n");
continue;
}
printf("%d %d\n", x * c / cmmdc , y * c / cmmdc);
}
return 0;
}