Cod sursa(job #586895)
Utilizator | Data | 3 mai 2011 10:39:43 | |
---|---|---|---|
Problema | Algoritmul lui Euclid extins | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.57 kb |
#include <stdio.h>
FILE *f,*s;
int i,j,k,l,m,n;
int a,b,c,d;
int x,y;
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=fopen("euclid3.in","r");
s=fopen("euclid3.out","w");
fscanf(f,"%d",&n);
for(i=1;i<=n;i++)
{
fscanf(f,"%d %d %d",&a,&b,&c);
d=gcd(a,b,x,y);
if (c%d) fprintf(s,"0 0\n");
else fprintf(s,"%d %d\n",x*(c/d),y*(c/d));
}
fclose(s);
return 0;
}