Pagini recente » Cod sursa (job #847110) | Cod sursa (job #2332076) | Cod sursa (job #2354906) | Cod sursa (job #1451497) | Cod sursa (job #2079887)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("euclid3.in");
ofstream out("euclid3.out");
long sol[3],a,b,c;
bool exista;
bool esol(short k)
{
if(k<2)
return 0;
return (a*sol[1]+b*sol[2])==c;
}
void back(short k)
{
for(long i=-c*100;i<=c*100 && !exista;++i)
{
sol[k]=i;
if(esol(k))
{
exista=1;
out<<sol[1]<<' '<<sol[2]<<'\n';
}
else if(k<2)
back(1+k);
}
}
int main()
{
short T;
in>>T;
for(short i=0;i<T;++i)
{
exista=0;
in>>a>>b>>c;
back(1);
if(!exista)
out<<0<<' '<<0<<'\n';
}
return 0;
}