Cod sursa(job #1132951)
| Utilizator | Data | 4 martie 2014 09:45:48 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid extins | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
using namespace std;
ifstream f("euclid3.in");
ofstream g("euclid3.out");
int i,T;
int a,b,C;
inline int gcd(int A,int B,int &X,int &Y)
{
if(B==0)
{
X=1;
Y=0;
return A;
}
int X0,Y0,D;
D=gcd(B,A%B,X0,Y0);
X=Y0;
Y=X0-(A/B)*Y0;
return D;
}
int main()
{
f>>T;
for(i=1;i<=T;i++){
f>>a>>b>>C;
int D,X,Y;
D=gcd(a,b,X,Y);
if(C%D)
g<<"0 0"<<endl;
else
g<<X*(C/D)<<" "<<Y*(C/D)<<endl;}
return 0;
}
