C++题目，求两个正整数的最小公倍数

Question

如题所述

Answer 1

#include <iostream>
using namespace std;
int main()
{
int a,b;
cin>>a>>b;
for(int i = a ; i <= a * b ; ++i)
{
if(i % a == 0 && i % b == 0)
{
cout<<i;
return 0;
}
}
}本回答被网友采纳

Answer 2

#include<iostream>

using namespace std;

int Gongyue(int a,int b) {

int temp; 

if(a < b) {

temp = a;

a = b;

b = temp;

}

while(a%b != 0) {

temp = a%b;

a = b;

b = temp;

}

return b;

}

int main() {

int m,n,re;

cin>>m>>n;

re=m*n;

re=re/Gongyue(m,n);

cout<<re<<endl;

return 0;

}