打卡24

4.2最大公倍数

 

#include<bits/stdc++.h>
using namespace std;

void solve()
{
int m,n,temp,b,low,k;
cin>>m>>n;
k=m*n;
if(m<n)swap(m,n);
b=m%n;
while(b){
m=n;n=b;b=m%n;
}
low=k/n;
cout<<low<<endl;
}

int main()
{
int t;cin>>t;
while(t--)
{
solve();
}
return 0;
}