Pagini recente » Cod sursa (job #1736325) | Cod sursa (job #1785325) | Cod sursa (job #1848031) | Cod sursa (job #1815368) | Cod sursa (job #2038951)
#include <iostream>
#include <cstdio>
#include <queue>
using namespace std;
int n,a,b,c,d;
pair<long long, long long> r;
pair<long long, long long> euclid(int la, int lb)
{
if(lb==0)
{
d=la;
return {1,0};
}
auto p=euclid(lb,la%lb);
return {p.second,p.first-(la/lb)*p.second};
}
int main()
{
freopen("euclid3.in","r",stdin);
freopen("euclid3.out","w",stdout);
scanf("%d",&n);
for(int i=0;i<n;i++)
{
scanf("\n%d %d %d", &a, &b, &c);
r=euclid(a,b);
if(c%d==0)
{
cout<<r.second*(c/d)<<" "<<r.first*(c/d)<<"\n";
}
else
cout<<"0 0\n";
}
return 0;
}