题目1438：最小公倍数

#include <vector>#include <cstring>#include <algorithm>#include <string>#include <string.h>#include <stack>#include <iostream>using namespace std;//1438int a,b;int gcd(int a,int b){    return b==0?a:gcd(b,a%b);}int main(){    while(cin>>a>>b){        if(a<b) swap(a,b);        cout<<a*b/gcd(a,b)<<endl;    }    return 0;}/**************************************************************    Problem: 1438    User: cust123    Language: C++    Result: Accepted    Time:10 ms    Memory:1520 kb****************************************************************/