51 NOD 1012 最小公倍数LCM

//最小公倍数与最大公倍数的乘积等于这两个数的乘积#include<iostream>using namespace std;long long GCD(long long a,long long b);long long LCM(long long a,long long b);int main(){long long a,b;while(cin>>a>>b){   GCD(a,b);   cout<<LCM(a,b)<<endl;    }return 0; }  long long GCD(long long a,long long b) { long long temp; while(b){ temp=b; b=a%b; a=temp; } return a; }long long LCM(long long a,long long b) { long long c; c=a*b/GCD(a,b); return c; }