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