Pagini recente » Cod sursa (job #270678) | Cod sursa (job #1187131) | Cod sursa (job #354749) | Cod sursa (job #1858665) | Cod sursa (job #2038936)
#include <iostream>
#include <cstdio>
using namespace std;
long long int n, a, b, c, d;
pair<long long, long long> euclidext(long long a, long long b)
{
if(b==0)
{
d=a;
return {1, 0};
}
pair<long long, long long> p=euclidext(b, a%b);
return {p.second, p.first-p.second*(a/b)};
}
int main()
{
freopen("euclid3.in", "r", stdin);
freopen("euclid3.out", "w", stdout);
scanf("%lld\n", &n);
for(int i=0;i<n;i++)
{
scanf("%lld %lld %lld\n", &a, &b, &c);
pair<long long, long long> p=euclidext(a, b);
if(c%d!=0)
printf("0 0\n");
else
{
int aux=c/d;
int k=p.first;
int l=p.second;
printf("%lld %lld\n", k*aux, l*aux);
}
}
return 0;
}