Pagini recente » Cod sursa (job #662624) | Cod sursa (job #1680215) | Cod sursa (job #1670129) | Cod sursa (job #2242563) | Cod sursa (job #1342276)
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <deque>
#define INF (1<<30)
#define mod 666013
using namespace std;
int t, a, b, c, d, x, y;
int E(int a, int b)
{
if(b==0)
{
x=1;
y=0;
return a;
}
int d=E(b, a%b);
int yy=y;
y=x-y*(a/b);
x=yy;
return d;
}
int main()
{
freopen("euclid3.in", "r", stdin);
freopen("euclid3.out", "w", stdout);
scanf("%d", &t);
while(t--)
{
scanf("%d%d%d", &a, &b, &c);
x=y=0;
d=E(a, b);
if(c%d)
printf("0 0\n");
else
printf("%d %d\n", x*c/d, y*c/d);
}
return 0;
}