AOJ 0005 GCD and LCM 最大公约数和最小公倍数入门

Write a program which computes the greatest common divisor (GCD) and the least common multiple (LCM) of given a and b.
Input
Input consists of several data sets. Each data set contains a and b separated by a single space in a line. The input terminates with EOF.
Constraints
0 < a, b ≤ 2,000,000,000
LCM(a, b) ≤ 2,000,000,000
The number of data sets ≤ 50
Output
For each data set, print GCD and LCM separated by a single space in a line.
Sample Input
8 6
50000000 30000000
Output for the Sample Input
2 24
10000000 150000000

题目大意：求两数的最大公约数和最小公倍数。
解题思路：辗转相除法

int gcd(int a, int b) {
	return b == 0 ? a : gcd(b, a%b);
}
lcm(a,b)=a / gcd(a,b) * b;

AC代码：

#include<iostream>
#include<stdio.h>
using namespace std;

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

int main() {
	int a, b;
	while (scanf("%d%d", &a, &b) != EOF) {
		int tmp = gcd(a, b);
		a = a / tmp*b;
		printf("%d %d\n", tmp, a);
	}
}