ACM (TJU) : 3150



#include <stdio.h>

int gcd ( int a, int b )
{
	if ( b == 0 )
		return a;
	gcd ( b, a % b );
}

int main ()
{
	int n;
	int testCase = 0;
	scanf ("%d", &n);

	while ( n-- ) {

		int x, y;
		scanf ("%d %d", &x, &y);

		int g = gcd ( x, y );

		printf ("%d %d %d\n", ++testCase, (x*y)/g, g);
	}
	return 0;
}

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s