Cod sursa(job #2175026)
Utilizator | Data | 16 martie 2018 14:48:35 | |
---|---|---|---|
Problema | Algoritmul lui Euclid extins | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.61 kb |
#include <fstream>
using namespace std;
ifstream fin("euclid3.in");
ofstream fout("euclid3.out");
int gcd(int a,int b,int &x,int &y)
{
if(!b)
{
x=1;
y=0;
return a;
}
int d,x0,y0;
d=gcd(b,a%b,x0,y0);
x=y0;
y=x0-(a/b)*y0;
return d;
}
int main()
{
int teste,a,b,c;
fin>>teste;
for(int pas=teste;pas;pas--)
{
fin>>a>>b>>c;
int x,y;
int d=gcd(a,b,x,y);
if(c%d)
fout<<0<<" "<<0;
else
fout<<x*(c/d)<<" "<<y*(c/d);
fout<<"\n";
}
return 0;
}