Cod sursa(job #1608670)
Utilizator | Data | 22 februarie 2016 11:48:02 | |
---|---|---|---|
Problema | Algoritmul lui Euclid extins | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.63 kb |
#include <stdio.h>
inline int euclid(long a,long b,long &x,long &y){
if(!b){
x=1;
y=0;
return a;
}
long x0,y0,d;
d=euclid(b,a%b,x0,y0);
x=y0;
y=x0-a/b*y0;
return d;
}
int main(){
short t;
FILE*f=fopen("euclid3.in","r");
fscanf(f,"%hd",&t);
FILE*g=fopen("euclid3.out","w");
while(t--){
long a,b,c,d,x,y;
fscanf(f,"%ld %ld %ld",&a,&b,&c);
d=euclid(a,b,x,y);
if(c%d)
fprintf(g,"0 0\n");
else
fprintf(g,"%ld %ld\n",x*(c/d),y*(c/d));
}
fclose(f);
fclose(g);
return 0;
}