Cod sursa(job #1264409)
| Utilizator | Data | 15 noiembrie 2014 19:48:40 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid extins | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include<fstream>
using namespace std;
ifstream in("euclid3.in");
ofstream out("euclid3.out");
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()
{
int T,A,B,C,D,X,Y;
for(; T ; --T){
in>>A>>B>>C;
D = gcd(A,B,X,Y);
if(C % D)
out<<"0 0\n";
else out<<X*(C/D)<<" "<<Y*(C/D)<<"\n";
}
return 0;
}
