GCD——LCM模板

#include<cstdio>#include<algorithm>#include<iostream>#include<cstring>#include<sstream>#include<vector>using namespace std;const int maxn=1000;string s;int GCD(int a,int b){    if(a<b)    swap(a,b);    if(b==0) return a;    else GCD(b,a%b);}int NGCD(int *a,int n){    if(n==1) return *a;    return GCD(a[n-1],NGCD(a,n-1));}int LCM(int a,int b){    return a*b/GCD(a,b);}int NLCM(int *a,int n){    if(n==1) return *a;    return LCM(a[n-1],NLCM(a,n-1));}int main(){    //freopen("in.txt","r",stdin);    int a,b,ans;    while(cin>>a>>b)         cout<<LCM(a,b)<<endl;    return 0;}