Cod sursa(job #986357)
| Utilizator | Data | 18 august 2013 16:02:45 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid extins | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
using namespace std;
ifstream f("euclid3.in");
ofstream g("euclid3.out");
int T,a,b,c,d,x,y;
int euclid(int a,int b)
{
if(!b)
{
x=1; y=0;
return a;
}
//int d0=euclid(b,a%b);
int x0=x,y0=y;
x=y0; y=x0-(a/b)*y0;
return euclid(b,a%b);
}
int main()
{
f>>T;
for(int i=1;i<=T;i++)
{
f>>a>>b>>c;
d=euclid(a,b);
if(c % d!=0)g<<"0 0"<<'\n';
else g<<x*(c/d)<<" "<<y*(c/d)<<'\n';
}
f.close();g.close();
return 0;
}
