gcd && lcm

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;

const int MOD=1e9+7;
ll n,m;

inline ll read(){
	ll ret=0,iep=1;char ch=getchar();
	while (ch<'0' || ch>'9'){if (ch=='-') iep=-1;ch=getchar();}
	while (ch>='0' && ch<='9'){ret=ret*10+ch-'0';ch=getchar();}
	return ret*iep;
}

inline int gcd(int a,int b){
	if (b==0) return a;
	else return gcd(b,a%b);
}
/*
gcd的一种简单的写法 
inline int gcd(int x,int y){
	while (x^=y^=x^=y%=x);return y;
}
*/

inline int lcm(int a,int b){
	return a*b/gcd(a,b);
}

int main(){
	n=read();m=read();
	cout<<lcm(n,m)<<endl;
}

For a record