Cod sursa(job #143250)

Utilizator bogdan2412Bogdan-Cristian Tataroiu bogdan2412 Data 26 februarie 2008 08:58:51
Problema Algoritmul lui Euclid extins Scor Ascuns
Compilator cpp Status done
Runda Marime 1.11 kb
#include <stdio.h>
#include <assert.h>

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;
}

inline int min( int a, int b ) { return (a < b) ? a : b; }

int main()
{
	freopen("euclid3.in", "rt", stdin);
	freopen("euclid3.out", "wt", stdout);

	int T;
	for (scanf("%d", &T), assert( T <= 100 ); T; T--)
	{
		int A, B, C;
		scanf("%d %d %d", &A, &B, &C);

		assert( -1000000000 <= A && A <= 1000000000 );
		assert( -1000000000 <= B && B <= 1000000000 );
		assert( -2000000000 <= C && C <= 2000000000 && C != 0 );

		if (B == 0)
		{
			if (A == 0 || C % A)
				printf("0 0\n");
			else
				printf("%d 0\n", C / A);
			continue;
		}

		int done = 0;
		for (int X = min( -C, C ); X <= -min( -C, C ) && !done; X++)
			if ((C - X * A) % B == 0)
			{
				printf("%d %d\n", X, (C - X * A) / B);
				done = 1;
			}
		if (!done)
			printf("0 0\n");

		/*
		int D, X, Y;
		D = gcd( A, B, X, Y );
		
		if (C % D)
			printf("0 0\n");
		else
			printf("%d %d\n", X * (C / D), Y * (C / D));*/
	}

	return 0;
}