题解：GCD and LCM（求GCD和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
给两数，求最大公约数与最小公倍数

在这里插入代码片#include<iostream>
#include<cmath>
using namespace std;
long long int gcd,a,b;
void g(int a,int b)
{
 if(a<b) swap(a,b);//a>b
 while(1)
 {
  a%=b;
  if(!a) 
  {
  	gcd=b;return;
  }
  swap(a,b);	
 } 	
} 
int main()
{
 while(cin>>a>>b)
 {
 	g(a,b);
 	cout<<gcd<<" "<<a*b/gcd<<endl;
 }
 return 0;
}