a,b=map(int,input().split())
for i in range(1,a*b+1):
    if i%a==0 and i%b==0:
        break
print(i)

#include <bits/stdc++.h>

using namespace std;

int main()

{

int a,b;

cin>>a>>b;

if(a>b) swap(a,b);

for(int i=b;i<=a*b;i++){

    if(i%a==0&&i%b==0){

        cout<<i<<endl;

        break;

    }

    if(i==a*b) cout<<i<<endl;

}

return 0;

}

管敏皓有点菜 #include <bits/stdc++.h>

using namespace std;

int main() { long long a,b; long long num=0; cin>>a>>b; for (int i =1;i<=b;i++) { for (int j =1;j<=a;j++) { if (bj==ia) { num=b*j; cout <<num; return 0; } } } return 0; }

发下答案不想做

def gcd(m,n): while m>0: m,n=n%m,m return n m,n=map(int,input().split()) print(m*n//gcd(m,n))