Cod sursa(job #2200740)
Utilizator | Data | 2 mai 2018 13:18:35 | |
---|---|---|---|
Problema | Algoritmul lui Euclid extins | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.67 kb |
#include <stdio.h>
int euclid(int a,int b, int &x, int &y)
{
int x1,y1,d,q;
if(b==0)
{
x=1;y=0;
return a;
}
else
{
q=a/b;
d=euclid(b,a%b,x1,y1);
x=y1;y=x1-q*y1;
return d;
}
}
int main()
{
int i,n,a,b,c,d,x,y;
FILE *f,*g;
f=fopen("euclid3.in","r");
g=fopen("euclid3.out","w");
fscanf(f,"%d",&n);
for(i=1;i<=n;i++)
{
fscanf(f,"%d%d%d",&a,&b,&c);
d=euclid(a,b,x,y);
if(c%d!=0)
fprintf(g,"0 0\n");
else
fprintf(g,"%d %d\n",c/d*x,c/d*y);
}
fclose(f);
fclose(g);
}