第十四届蓝桥杯集训——练习解题阶段(无序阶段)-ALGO-148 5-1最小公倍数

#include<stdio.h>
int main()
{
int i=1,j,a,b,n,m,t=1;
scanf("%d%d",&a,&b);
n=(a>b?a:b);m=(a<b?a:b);
while(t%m!=0)
{t=n*i;i++;}
printf("%d ",t);
return 0;
}

#include<iostream>
using namespace std;
int main()
{
	int a,b,i,j;
	cin>>a>>b;
	if(a>=b)
	{
		j=a;
	 }
	 else
	 j=b;
	 for(i=j;i<=a*b;i++)
	 {
	 	if(i%a==0&&i%b==0)
	 	{
	 		cout<<i;
	 		break;
		 }
	 }
	 return 0;
 } 

import java.io.*;
public class Main{

	public static void main(String[] args)throws Exception{
	
		BufferedReader in=new BufferedReader(new InputStreamReader(System.in));
		String[] s=in.readLine().split(" ");
		int a=Integer.parseInt(s[0]);
		int b=Integer.parseInt(s[1]);
		if(a>=b){
		 System.out.print(a*b/fun(a,b));
			
		}else{
		
			System.out.print(a*b/fun(b,a));
		}
		
	}
	public static int fun(int a,int b){
	
		int k;
		while(b>0){
		k=b;
			b=a%b;
			a=k;
		}
		return a;
	}
}

def getGreatestCommonDivison(A,B):
	A,B=(A,B) if A>=B else (B,A)
	if A%B==0:
		return B
	return getGreatestCommonDivison(A%B,B)



def lcm():
	A,B=list(map(int,input().split()))
	result=1
	first=getGreatestCommonDivison(A,B)
	if first!=1:
		while first!=1:
			A=int(A/first)
			B=int(B/first)
			result*=A*B*first
			first=getGreatestCommonDivison(A,B)
	else:
		result*=A*B
	print(result)
	
lcm()