Cod sursa(job #160734)
Utilizator | Data | 16 martie 2008 19:29:05 | |
---|---|---|---|
Problema | Algoritmul lui Euclid extins | Scor | 0 |
Compilator | c | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <stdio.h>
FILE *f,*g;
int T;
int a,b,c,d,x,y;
int find(int a,int b,int &x,int &y) {
if(!b){
x=1;
y=0;
return a;
}
int x1,y1,d;
d=find(b,a%b,x1,y1);
x=y1;
y=x1-a/b*y;
return d;
}
int main(){
f=fopen("euclid3.in","r");
g=fopen("euclid3.out","w");
fscanf(f,"%d",&T);
int i;
for(i=0;i<T;i++){
fscanf(f,"%d %d %d",&a,&b,&c);
d=find(a,b,x,y);
if(c%d!=0) fprintf(g,"0 0\n");
else {
c=c/d;
fprintf(g,"%d %d\n",x*c,y*c);
}
}
fclose(g);
return 0;
}