Cod sursa(job #574085)
Utilizator | Data | 6 aprilie 2011 20:09:59 | |
---|---|---|---|
Problema | Algoritmul lui Euclid extins | Scor | 100 |
Compilator | c | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <stdio.h>
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()
{
FILE *f,*g;
int D, X, Y,T,A, B, C;
f=fopen("euclid3.in", "r");
g=fopen("euclid3.out", "w");
for (fscanf(f,"%d", &T); T; T--)
{
fscanf(f,"%d %d %d", &A, &B, &C);
D = gcd( A, B, &X, &Y );
if (C % D)
fprintf(g,"0 0\n");
else
fprintf(g,"%d %d\n", X * (C / D), Y * (C / D));
}
return 0;
}