最小公倍数
#include<cstdio> #include<cstdlib> #include<cstring> #include<iostream> using namespace std; int gcd(int x,int y){ return y==0?x:gcd(y,x%y); } int main(){ int i,j,k,m,n; scanf("%d%d",&m,&n); printf("%d",m*n/gcd(m,n)); return 0; }
#include<cstdio> #include<cstdlib> #include<cstring> #include<iostream> using namespace std; int gcd(int x,int y){ return y==0?x:gcd(y,x%y); } int main(){ int i,j,k,m,n; scanf("%d%d",&m,&n); printf("%d",m*n/gcd(m,n)); return 0; }