Cod sursa(job #1222209)
Utilizator | Data | 22 august 2014 16:48:22 | |
---|---|---|---|
Problema | Algoritmul lui Euclid extins | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.6 kb |
#include <iostream>
using namespace std;
int gcd(int &x,int &y,int a,int b)
{
if(!b)
{
x=1;
y=0;
return a;
}
int x0,y0,d;
d=gcd(x0,y0,b,a%b);
x=y0;
y=x0-(a/b)*y0;
return d;
}
int main()
{
freopen("euclid3.in","r",stdin);
freopen("euclid3.out","w",stdout);
int T;
cin>>T;
while(T)
{
int a,b,c,d,x,y;
cin>>a>>b>>c;
d=gcd(x,y,a,b);
if(c%d)
cout<<"0 0\n";
else
cout<<x*(c/d)<<" "<<y*(c/d)<<"\n";
T--;
}
return 0;
}