Pagini recente » Cod sursa (job #2670775) | Cod sursa (job #1867105) | Cod sursa (job #2227933) | Cod sursa (job #608633) | Cod sursa (job #2874551)
#include <iostream>
#include <fstream>
#define define ll long long
using namespace std;
ifstream fin("euclid3.in");
ofstream fout("euclid3.out");
void euclid(ll a,ll b,ll &d,ll &k,ll &l)
{
if(b==0)
{
k=1;
l=0;
d=a;
return;
}
ll k2,l2;///k prim si l prim
euclid(b,a%b,d,k2,l2);
k=l2;
l=k2-(a/b)*l2;
}
int main()
{
///a*k+b*l = d, d=(a,b)
///k,l - coeficientii cautati (NU SUNT UNICI)
///(n am chef sa folosesc x si y)
ll a,b,c,k,l,d,t;
fin>>t;
for(int i=0;i<t;i++)
{
fin>>a>>b>>c;
euclid(a,b,d,k,l);
if(c%d!=0)
fout<<"0 0\n";
else
fout<<k*(c/d)<<" "<<l*(c/d)<<"\n";
}
return 0;
}