Pagini recente » Cod sursa (job #3183051) | Cod sursa (job #3033256) | IAP #2: Concurs pentru studenti | Cod sursa (job #2979469) | Cod sursa (job #694918)
Cod sursa(job #694918)
// Algoritmul lui Euclid extins
#include <fstream>
using namespace std;
void euclid(int a, int b, int &d, int &x, int &y){
if(b==0){
d=a; y=0; x=1;
}
else{
int xp,yp;
euclid(b,a%b,d,xp,yp);
x=yp;
y=xp-(a/b)*yp;
}
}
int main(){
int T,a,b,c,d,x,y;
ifstream in("euclid3.in");
ofstream out("euclid3.out");
in>>T;
for(;T>0;T--){
in>>a>>b>>c;
euclid(a,b,d,x,y);
if(c%d)
out<<"0 0\n";
else
out<<x*(c/d)<<" "<<y*(c/d)<<"\n";
}
}