Pagini recente » Cod sursa (job #1382003) | Cod sursa (job #268718) | Cod sursa (job #1683754) | Problema satisfiabilității formulelor logice de ordinul doi | Cod sursa (job #2640950)
#include <fstream>
using namespace std;
long long t,a,b,c,a1,a2,b1,b2,r,r1,r2,x,y;
int main()
{
ifstream f("euclid3.in");
ofstream g("euclid3.out");
f>>t;
while(t)
{
t--;
f>>a>>b>>c;
x=1;
y=1;
if(a<0)
{
a*=-1;
x=-1;
}
if(b<0)
{
b*=-1;
y=-1;
}
a1=1;
a2=0;
b1=0;
b2=1;
while(b)
{
r=a%b;
r1=a1-b1*(a/b);
r2=a2-b2*(a/b);
a=b;
a1=b1;
a2=b2;
b=r;
b1=r1;
b2=r2;
}
if(c-(c/a)*a==0) g<<a1*(c/a)*x<<" "<<a2*(c/a)*y<<'\n';
else g<<"0 0\n";
}
f.close(); g.close();
return 0;
}