Problem:
 Score : 300 points    Problem Statement  Takahashi is organizing a party.  At the party, each guest will receive one or more snack pieces.  Takahashi predicts that the number of guests at this party will be A or B .  Find the minimum number of pieces that can be evenly distributed to the guests in both of the cases predicted.  We assume that a piece cannot be divided and distributed to multiple guests.      Constraints   1 \leq A, B \leq 10^5  A \neq B  All values in input are integers.         Input  Input is given from Standard Input in the following format:  A  B       Output  Print the minimum number of pieces that can be evenly distributed to the guests in both of the cases with A guests and B guests.        Sample Input 1 2 3      Sample Output 1 6  When we have six snack pieces, each guest can take three pieces if we have two guests, and each guest can take two if we have three guests.       Sample Input 2 123 456      Sample Output 2 18696       Sample Input 3 100000 99999      Sample Output 3 9999900000

Solution (Python):
def main(sample_file = ''):

    """ convenient functions
    
    
    
    
    
    """

    """convenient decorator
    
    
        
        
        
        
        
        
        
        
        
        
    """
    
    
    import sys
    sys.setrecursionlimit(10**7)
    from itertools import accumulate, combinations, permutations, product 
    
    from math import factorial, ceil, floor, sqrt
    def factorize(n):
        """return the factors of the Arg and count of each factor
        
        Args:
            n (long): number to be resolved into factors
        
        Returns:
            list of tuples: factorize(220) returns [(2, 2), (5, 1), (11, 1)]
        """
        fct = []  
        b, e = 2, 0  
        while b * b <= n:
            while n % b == 0:
                n = n // b
                e = e + 1
            if e > 0:
                fct.append((b, e))
            b, e = b + 1, 0
        if n > 1:
            fct.append((n, 1))
        return fct
    def combinations_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        
        if n < 0 or r < 0:
            raise Exception('combinations_count(n, r) not defined when n or r is negative')
        if n - r < r: r = n - r
        if r < 0: return 0
        if r == 0: return 1
        if r == 1: return n
        numerator = [n - r + k + 1 for k in range(r)]
        denominator = [k + 1 for k in range(r)]
        for p in range(2,r+1):
            pivot = denominator[p - 1]
            if pivot > 1:
                offset = (n - r) % p
                for k in range(p-1,r,p):
                    numerator[k - offset] /= pivot
                    denominator[k] /= pivot
        result = 1
        for k in range(r):
            if numerator[k] > 1:
                result *= int(numerator[k])
        return result
    def combinations_with_replacement_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items allowing individual elements to be repeated more than once.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        if n < 0 or r < 0:
            raise Exception('combinations_with_replacement_count(n, r) not defined when n or r is negative')
        elif n == 0:
            return 1
        else:
            return combinations_count(n + r - 1, r)
    from bisect import bisect_left, bisect_right
    from collections import deque, Counter, defaultdict 
    from heapq import heapify, heappop, heappush, heappushpop, heapreplace,nlargest,nsmallest 
    from copy import deepcopy, copy 
    import operator
    from operator import itemgetter 
    
    
    from functools import reduce, lru_cache
    def chmin(x, y):
        """change minimum
        if x > y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current minimum value
            y (long): potential minimum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x > y:
            x = y
            return (x, True)
        else:
            return (x, False)
    def chmax(x, y):
        """change maximum
        if x < y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current maximum value
            y (long): potential maximum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x < y:
            x = y
            return (x, True)
        else:
            return (x, False)

    from fractions import gcd 
    def gcds(numbers):
        return reduce(gcd, numbers)
    def lcm(x, y):
        return (x * y) // gcd(x, y)
    def lcms(numbers):
        return reduce(lcm, numbers, 1)
    def make_divisors(n, reversed=False):
        """create list of divisors
        
        Args:
            number (int): number from which list of divisors is created
            reversed (bool, optional): ascending order if False. Defaults to False.
        
        Returns:
            list: list of divisors
        """
        divisors = set()
        for i in range(1, int(n**0.5)+1):
            if n % i == 0:
                divisors.add(i)
                divisors.add(n//i)
        return sorted(list(divisors),reverse=reversed)
    
    
    
    INF = 10 ** 18
    MOD = 10 ** 9 + 7
    modpow = lambda a, n, p = MOD: pow(a, n, p) 
    def modinv(a, p = MOD):
        
        
        return modpow(a, p-2, p)
    def modinv_list(n, p = MOD):
        if n <= 1:
            return [0,1][:n+1]
        else:
            inv_t = [0,1]
            for i in range(2, n+1):
                inv_t += [inv_t[p % i] * (p - int(p / i)) % p]
            return inv_t
    def modfactorial_list(n, p = MOD):
        if n == 0:
            return [1]
        else:
            l = [0] * (n+1)
            tmp = 1
            for i in range(1, n+1):
                tmp = tmp * i % p
                l[i] = tmp
            return l
    def modcomb(n, k, fac_list = [], p = MOD):
        
        
        from math import factorial
        if n < 0 or k < 0 or n < k: return 0
        if n == 0 or k == 0: return 1
        if len(fac_list) <= n:
            a = factorial(n) % p
            b = factorial(k) % p
            c = factorial(n-k) % p
        else:
            a = fac_list[n]
            b = fac_list[k]
            c = fac_list[n-k]
        return (a * modpow(b, p-2, p) * modpow(c, p-2, p)) % p
    def modadd(a, b, p = MOD):
        return (a + b) % MOD
    def modsub(a, b, p = MOD):
        return (a - b) % p
    def modmul(a, b, p = MOD):
        return ((a % p) * (b % p)) % p
    def moddiv(a, b, p = MOD):
        return modmul(a, modpow(b, p-2, p))

    class UnionFindTree:
        """union find tree class
        TODO: fix this description...
        how to use (example):
        >>  uf = UnionFindTree(N) 
        >>  if uf.find_root(a) == uf.find_root(b):
        >>      do something
        >>  else:
        >>      do something
        >>      uf.unite(a, b)
        """
        def __init__(self, N):
            self.root = [-1] * (N+1)
            self.rank   = [0]  * (N+1)
            self.connected_num = [1] * (N+1)
    
        def find_root(self,x):
            root = self.root
            while root[x] != -1:
                x = root[x]
            return x
    
        def unite(self,x,y):
            root = self.root
            rank = self.rank
            connected_num = self.connected_num
            find_root = self.find_root
    
            rx = find_root(x)
            ry = find_root(y)
            if rx != ry:
                if rank[rx] < rank[ry]:
                    root[rx] = ry
                    rx,ry = ry,rx
                else:
                    if rank[rx] == rank[ry]:
                        rank[rx] += 1
                    root[ry] = rx       
                connected_num[rx] += connected_num[ry]

    
    
    
    
    

    def BellmanFord(N, M, ABC, vertex_start, vertex_end, value_if_inf = -1, find_shortest = False):
        """to calculate furthest or shortest length between vertex_start and vertex_end using BellmanFord algorithm
        
        Args:
            N (int): number of vertices
            M (int): number of edges
            ABC (list): [(ai, bi, ci) for _ in range(N)] where i-th edge is directed from vertex ai to vertex bi and the length is ci 
            vertex_start (int): start vertex. usually use 0.
            vertex_end (int): end vertex. usually use N-1.
            value_if_inf (int or string as you like, optional): value you want when the furthest (or shortest) distance is infinite (or -infinite). Defaults to -1.
            find_shortest (bool, optional): choose False to find furthest path. Defaults to False.
        
        Returns:
            int or string: normally int (but can be str if you set value_if_inf to str)
            
        Example:
                N, M, P = R()
                ABC = [R() for _ in range(M)]
                ABC = [(a-1, b-1, c-P) for a, b, c in ABC]
                print(BellmanFord(N, M, ABC, 0, N-1, value_if_inf = 'inf'))

        """

        def make_reachable_list(N, M, ABC, vertex_start, vertex_end):
            reachable_to_direct = defaultdict(list)
            reachable_from_direct = defaultdict(list)
            reachable_from_start = [False] * N
            reachable_to_end = [False] * N
            reachable_from_start[vertex_start] = True
            reachable_to_end[vertex_end] = True
            reachable_from_both_sides = [False] * N
            dfs_from_start = []
            dfs_to_end = []
            for a, b, c in ABC:
                reachable_to_direct[a].append(b)
                reachable_from_direct[b].append(a)
                if a == vertex_start:
                    dfs_from_start.append(b)
                    reachable_from_start[b] = True
                if b == vertex_end:
                    dfs_to_end.append(a)
                    reachable_to_end[a] = True
            while dfs_from_start:
                v = dfs_from_start.pop()
                for i in reachable_to_direct[v]:
                    if not reachable_from_start[i]:
                        reachable_from_start[i] = True
                        dfs_from_start.append(i)
            while dfs_to_end:
                v = dfs_to_end.pop()
                for i in reachable_from_direct[v]:
                    if not reachable_to_end[i]:
                        reachable_to_end[i] = True
                        dfs_to_end.append(i)
            for i in range(N):
                reachable_from_both_sides[i] = reachable_from_start[i] and reachable_to_end[i]
            return reachable_from_both_sides
        
        reachable_from_both_sides = make_reachable_list(N, M, ABC, vertex_start, vertex_end)
        
        if find_shortest:
            dist = [INF for i in range(N)]
        else:
            dist = [-INF for i in range(N)]
        
        dist[vertex_start] = 0
        for i in range(N):
            updated = False
            for a, b, c in ABC:
                if not reachable_from_both_sides[a]:
                    continue
                elif find_shortest:
                    update_condition = dist[a] + c < dist[b]
                else:
                    update_condition = dist[a] + c > dist[b]
                if dist[a] != INF and update_condition:
                    dist[b] = dist[a] + c
                    updated = True
                    if i == N-1:
                        return value_if_inf
            if not updated:
                break
        return dist[vertex_end]

    """ initialize variables and set inputs
    
        
        
            
            
    
        
        
        
        
        
        
        
    
        
        
        
        
    
        
        
    """

    
    r = lambda: sys.stdin.readline().strip()
    r_int = lambda: int(r())
    r_float = lambda: float(r())
    R = lambda: list(map(int, r().split()))
    R_str = lambda: r().split()
    R_map = lambda: map(int, r().split())
    R_float = lambda: list(map(float, r().split()))
    R_tuple = lambda: tuple(map(int, r().split()))

    """ how to treat input
    
    
    
    
    
    
    
    """

    
    if sample_file:
        sys.stdin = open(sample_file)
        
    
    

    A, B = R()
    print(lcm(A, B))
    
    
    
    

    """memo: how to use defaultdict of list
    
    Dic = defaultdict(list)
    
    Dic[x].append(y)
    
    for k, v in Dic.items():
    """
    
    """memo: how to solve binary problems
    
    >>> a = 5
    >>> bin_str_a = format(a, '
    >>> print(bin_str_a)
    0b0101 
    """
    
    """memo: how to solve the problem
    creating simple test/answer
    greed
    simple dp
    graph
    """

if __name__ == '__main__':
    main()

Solution (Python):
import math

a,b = map(int,input().split())

def prime_factorize(n):
    a = []
    while n % 2 == 0:
        a.append(2)
        n //= 2
    f = 3
    while f * f <= n:
        if n % f == 0:
            a.append(f)
            n //= f
        else:
            f += 2
    if n != 1:
        a.append(n)
    return a

a_ = prime_factorize(a)
b_ = prime_factorize(b)

for i in a_:
    if i in b_:
        b_.remove(i)

for j in b_:
    a *= j

print(a)

Solution (Python):
from fractions import gcd
def lcs(a, b) :
    return a * b // gcd(a, b)

a, b = map(int,input().split())
print(lcs(a, b))

Solution (Python):
A, B = map(int, input().split())
a = A
b = B
while True:
    tmp,r = divmod(a,b)
    if r == 0:
        break
    a = b
    b = r
gcd = b
ans = (A//gcd) * (B//gcd) * gcd
print(ans)

Solution (Python):
a, b = [int(i) for i in input().split()]

def gcd(m, n):
  t = m % n
  while(t>0):
    m = n
    n = t
    t = m % n
  
  return n

def lcm(m, n):
  return m * n // gcd(m, n)

print(lcm(a, b))

Solution (Python):
import fractions as fr
a, b = map(int, input().split())
res = int(a*b / fr.gcd(a, b))
print(res)

Solution (Python):



def gcd(a,b):
    if(a<b):
         b,a=a,b
    if(b==0):
        return a
    r = a%b
    if(r!=0) :
        a,b,r=b,r,b%r
        return gcd(b,r)
    else:
        return b

A,B = map(int, input().split())
print(A*B//gcd(A,B))

Solution (Python):
import fractions
a,b =map(int,input().split())
print(a * b // fractions.gcd(a, b))

Solution (Python):
from fractions import gcd
a,b = map(int, input().split())
print(a*b//gcd(a,b))

Solution (Python):
import fractions

a, b = map(int, input().split())
print(int(a*b/fractions.gcd(a, b)))

Solution (Python):
import sys
input = sys.stdin.buffer.readline

def gcd(a: int, b: int):
    """ https://cocodrips.hateblo.jp/entry/2014/03/05/143623
    """
    while b:
        a, b = b, a%b
    return a

def lcm(a: int, b: int):
    return a * b // gcd(a, b)


def main():
    N, M = map(int, input().split())
    
    print(lcm(N, M))

if __name__ == "__main__":
    main()

Solution (Python):
import fractions as fr
A,B=map(int,input().split())
print(A*B//fr.gcd(A,B))

Solution (Python):
from fractions import gcd

A, B = map(int, input().split())

print(A * B // gcd(A, B))

Solution (Python):
import fractions
def lcm(x, y):
    return (x * y) // fractions.gcd(x, y)

a,b = map(int,input().split())

print(lcm(a, b))

Solution (Python):
from fractions import gcd

a,b = map(int,input().split())
print(int(a*b//gcd(a,b)))

Solution (Python):
def GCD(a: int, b: int) -> int:
    return a if b == 0 else GCD(b, a % b)


def LCM(a: int, b: int) -> int:
    return a * b // GCD(a, b)


a, b = map(int, input().split())
ans = LCM(a, b)
print(ans)

Solution (Python):
def gcd(m,n):
  x = max(m, n)
  y = min(m, n)
  
  if x%y == 0:
    return y
  else:
    while x%y!=0:
      z=x%y
      x=y
      y=z
    else:
      return z
def lcm(m,n):
  return int(m*n/gcd(m,n))

Num = input().split()
A = int(Num[0])
B = int(Num[1])

print(lcm(A,B))

Solution (Python):
import fractions
a,b = map(int,input().split())
print(int(a * b / fractions.gcd(a, b)))

Solution (Python):
import fractions
a,b = map(int,input().split())
print(int(a * b / fractions.gcd(a, b)))

Solution (Python):
from fractions import *
a, b=map(int, input().split())
print(a * b // gcd(a, b))

Solution (Python):
A,B=input().split()
a=int(A)
b=int(B)
 
c=min(a,b)
 
def sosu(x):
    sum=0
    for i in range(x):
        if x%(i+1)==0:
            sum+=1
    if sum==2:
        return True
    else:
        return False

j=2  
kobai=[]
while j<=c:
  if a%j==0 and b%j==0 and sosu(j):
    c=int(c/j)
    kobai.append(j)
    
    a=int(a/j)
    b=int(b/j)
    j=2
   
  else:
    j+=1

answer=int(A)*int(B)
for i in range(len(kobai)):
  answer=int(answer/kobai[i])

print(answer)

Solution (Python):
A, B = map(int, input().split())
a, b = min(A, B), max(A, B)
while b%a > 0:
    a, b = b%a, a
print(A*B//a)

Solution (Python):
A, B = map(int, input().split())

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

print(A*B//gcd(A, B))

Solution (Python):
def gcm(a,b):
  if a==0:
    return b
  elif b==0:
    return a
  elif a>=b:
    return gcm(a%b,b)
  else:
    return gcm(a,b%a)
  
a,b=map(int,input().split())
print(a*b//gcm(a,b))

Solution (Python):
import fractions

X = [int(x) for x in input().split()]

v = fractions.gcd(X[0], X[1])
j = X[0] / v
p = int(X[1] * j)

print(p)

Solution (Python):
a,b = map(int, input().split())

def gcd(a,b):
  while b!=0:
    a,b=b,a%b
  return a


  
def lcm(a,b):
  return a*b//gcd(a,b)

print(lcm(a,b))

Solution (Python):
A, B = map(int, input().split())

def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a % b)

print(A * B // gcd(A, B))

Solution (Python):
from fractions import gcd
A, B = map(int, input().split())
print(A * B // gcd(A, B))

Solution (Python):
import sys

def main():

    

    a, b = map(int, input().split())

    ai = a
    bi = b

    while ai != bi:
        if ai < bi:
            ai += a
        else:
            bi += b

    print(ai)

if __name__ == '__main__':
    main()

Solution (Python):
A = list(map(int, input().split())) 
B = A[0]
C = A[1]

BB = []
CB = []

def myfunc(X, XX):
  for num in range(2, X+1):
    if(X%num == 0):
      XX.append(num)
      BA = int(X/num)
      myfunc(BA, XX)
      break

myfunc(B, BB)
myfunc(C, CB)

for num1 in BB:
  for num2 in range(len(CB)):
    if num1 == CB[num2]:
      CB.pop(num2)
      break

BB.extend(CB)

ANSWER = 1

for num in BB:
  ANSWER = num * ANSWER

print(ANSWER)

Solution (Python):
import fractions

a, b = map(int,input().split())	

print(a * b // fractions.gcd(a, b))

Solution (Python):
import fractions
a,b=map(int, input().split())
f=fractions.gcd(a,b)
f2=a*b//f
print(f2)

Solution (Python):
def binary(x,y):
    if x%y==0:
        return y
    else:
        return binary(y,x%y)

S=str(input())
A=int(S.split()[0])
B=int(S.split()[1])
C=binary(A,B)

print(int(A/C*B))

Solution (Python):
A,B=map(int,input().split())
a,b = A,B
Common = 1
for n in range(min(A,B)-1):
  while True:
    if a%(n+2) == 0 and b%(n+2) == 0:
      Common*=n+2
      a/=n+2
      b/=n+2
    else:
      break
print(int(A/Common*B))

Solution (Python):

import fractions

a, b = map(int, input().split())

print((a * b) // fractions.gcd(a, b))

Solution (Python):
def pgcd(m,n): 
    while m%n: 
        r=m%n 
        m=n 
        n=r 
    return n 
 
def ppcm(m,n): 
    return m*n//pgcd(m,n)

a,b=map(int,input().split())
print(ppcm(a,b))

Solution (Python):
import fractions

a, b = map(int, input().split())
ans = a * b / fractions.gcd(a,b)
print(int(ans))

Solution (Python):
def gcd(a, b):
    a, b = max(a, b), min(a, b)
    if b == 0:
        return a
    return gcd(b, a % b)


def lcm(a, b):
    return a * b // gcd(a, b)


def main():
    A, B = map(int, input().split())
    print(lcm(A, B))


if __name__ == "__main__":
    main()

Solution (Python):
import sys

input = sys.stdin.readline


class AtCoder:
    def main(self):
        A, B = map(int, input().split())

        ans = (A * B) // self.gcd(A,B)
        print(ans)

    def gcd(self, a, b):
        if b == 0:
            return a
        else:
            return self.gcd(b, a % b)


if __name__ == '__main__':
    AtCoder().main()

Solution (Python):
import fractions
a,b=map(int,input().split())
print((a*b)//fractions.gcd(a,b))

Solution (Python):

import fractions

a,b=map(int,input().split())
print(int(a*b/fractions.gcd(a,b)))

Solution (Python):

def gcd(a,b):
    if(a>b):a,b=b,a
    if(a==0):return b
    return gcd(b%a,a)

a,b=map(int,input().split())
print(int(a*b/gcd(a,b)))

Solution (Python):
import fractions

a, b = (int(i) for i in input().split())

print(a * b // fractions.gcd(a, b))

Solution (Python):
a, b = map( int, open( 0 ).read().split())

import math

def max( int: a, b ) -> int:
  if a < b:
    return b
  return a

def min( int: a, b ) -> int:
  if a < b:
    return a
  return b

def gcd( a, b ):
  x = max( a, b )
  y = min( a, b )

  b = x
  r = y
  while( r != 0 ):
    a = b
    b = r
    r = a % b
  return b

print( int( a * b / gcd( a, b ) ))

Solution (Python):
import  fractions
def lcm(x, y):
    return (x * y) // fractions.gcd(x, y)
a,b = map(int, input().split())
print(lcm(a,b))

Solution (Python):
x,y = map(int,input().split())

import fractions

def lcm(x,y):
  return x*y//fractions.gcd(x,y)

print(lcm(x,y))

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

Solution (Python):
import fractions
def solve():
    A, B = map(int, input().split())
    print((A*B // fractions.gcd(A,B)))

if __name__ == '__main__':
    solve()

Solution (Python):
def solve():
    A, B = map(int, input().split())
    x = A * B
    if A < B:
        tmp = A
        A = B
        B = tmp
    
    r = A % B
    while(r!=0):
        A = B
        B = r
        r = A % B
    
    print(int(x/B))

if __name__ == '__main__':
    solve()

Solution (Python):
import fractions
abc = list(map(int, input().split()))
a=abc[0]
b=abc[1]
c=fractions.gcd(a,b)
d=a*b
print(d//c)

Solution (Python):
def gcd(a,b):
    while b!=0:
        a,b = b,a%b
    return a

def lcm(a,b):
    return(int((a*b / gcd(a,b))))
    
A,B=map(int,input().split())
print(lcm(A,B))

Solution (Python):

a, b = map(int, input().split())

if a<b:
    tmp = a
    a = b
    b = tmp

x = a*b

r = a%b
while r != 0:
    a = b
    b = r
    r = a%b

print(x//b)

Solution (Python):
from fractions import gcd
from functools import reduce

def lcm_base(x, y):
    return (x * y) // gcd(x, y)
  
A,B = map(int,input().split())
print(lcm_base(A,B))

Solution (Python):
def gcd(x,y):
    if y<=0:
        return x
    return gcd(y,x%y)

def lcm(x,y):
    return x*y//gcd(x,y)
    
A,B = map(int,input().split())
print(lcm(A,B))

Solution (Python):
a,b=map(int,input().split())
def gcd(n,m):
  n,m=max(n,m),min(n,m)
  while m!=0:
    n,m=m,n%m
  return n
print(int(a*b/gcd(a,b)))

Solution (Python):
def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a% b)

a, b = map(int,input().split())
print((a * b)// gcd(a, b))

Solution (Python):
def gcd(a,b):
  if b>a:
    a,b=b,a
  while a%b:
    a,b=b,a%b
  return b

A,B=map(int,input().split())
print(A*B//gcd(A,B))

Solution (Python):
li = list(map(int, input().split()))
a = li[0]
b = li[1]

def gcd(a,b):
 while b!=0:
   a,b=b,a%b
 return a

print(a*b//gcd(a,b))

Solution (Python):
def gcd(a, b):
    while b:
        a, b = b, a % b
    return a

a, b = map(int, input().split())
print((a * b) // gcd(a, b))

Solution (Python):
def gcd(a,b):
    if b == 0:
        return a
    return gcd(b, a%b)

A,B=map(int, input().split())
print(A*B//gcd(A,B))

Solution (Python):
import fractions

def main():
    A, B = list(map(int, input().split()))
    print(lcm(A, B))

def lcm(a, b):
    return a * b // fractions.gcd(a, b)

if __name__ == "__main__":
    main()

Solution (Python):
A,B=map(int,input().split())
C=A*B
if A<B :
    A,B=B,A
while A%B!=0:
    A,B=B,A%B 
D=C/B
print(int(D))

Solution (Python):
a, b = map(int,input().split(" "))

for i in range(b):
  if (a * (i+1))%b == 0:
    print(a*(i+1))
    break

Solution (Python):
import fractions
A,B = input().split()

print(int(int(A) * int(B) / fractions.gcd(int(A),int(B))))

Solution (Python):
from fractions import gcd

a,b=list(map(int,input().split()))
print(a*b//gcd(a,b))

Solution (Python):
from fractions import gcd


def solve(string):
    a, b = map(int, string.split())
    return str(a * b // gcd(a, b))


if __name__ == '__main__':
    import sys
    print(solve(sys.stdin.read().strip()))

Solution (Python):
import fractions
a, b = map(int, input().split())

print(int(a*b/fractions.gcd(a, b)))

Solution (Python):
a,b = map(int,input().split())

def gcd(x, y):
    if x < y:
        x, y = y, x
    while y > 0:
        x, y = y, x % y
    return x

print(a * b // gcd(a, b))

Solution (Python):
import fractions
a, b = map(int, input().split())

ans = a*b // fractions.gcd(a,b)

print(ans)

Solution (Python):
a,b = map(int,input().split())
def gcd(a,b):
  while b!=0:
    a,b=b,a%b
  return a

def lcm(a,b):
  return a*b//gcd(a,b)
print(lcm(a,b))

Solution (Python):
from fractions import gcd

A, B = map(int, input().split())
print((A * B) // gcd(A, B))

Solution (Python):
import fractions

s = list(map(int,input().split()))

print((s[0] * s[1]) // fractions.gcd(s[0], s[1]))

Solution (Python):
a,b = map(int, input().split())

import fractions

print(int(a*b/fractions.gcd(a,b)))

Solution (Python):
import fractions
A,B=map(int,input().split())
S=A*B//fractions.gcd(A,B)
print(S)

Solution (Python):
import fractions
a,b=map(int, input().split(' '))
def lcm(a, b):
    return a*b//fractions.gcd(a, b)
print(lcm(a, b))

Solution (Python):
A,B=map(int,input().split())
if A > B:
    C=A
else:
    C=B
for i in range(1,C):
    if (A%i==0 and B%i==0):
        temp=i
print(int(A*B/temp))

Solution (Python):
import fractions
a,b = input().split()

print(int(a)*int(b)//fractions.gcd(int(a), int(b)))

Solution (Python):

A, B = map(int, input().split())


import fractions

C = fractions.gcd(A, B)
print(A*B//C)

Solution (Python):
import fractions as math
a,b = map(int,input().split())

gcd = int(a*b/math.gcd(a,b))

print(gcd)

Solution (Python):
AB = input().split()
A = int(AB[0])
B = int(AB[1])

def gcd(a, b):
  while b!=0:
    a, b = b, a%b
  return a

def lcm(a, b):
  return (a*b) / gcd(a, b)

print(int(lcm(A, B)))

Solution (Python):
from fractions import gcd
a,b = map(int, input().split())

print((a * b) // gcd(a,b))

Solution (Python):
def gcd(x, y):
    if x % y == 0:
        return y
    return gcd(y, x % y)


A, B = map(int, input().split())
print(A * B // gcd(A, B))

Solution (Python):
from fractions import gcd
a,b = map(int, input().split())
print((a*b) // gcd(a,b))

Solution (Python):
A, B = map(int, input().split())
def ab(a, b):
  while b != 0:
    a, b = b, a % b
  return a
def sd(a, b):
  return a * b // ab(a, b)
print(sd(A, B))

Solution (Python):
def wczytaj_liste(): 
    wczytana_lista = input()
    lista_znakow = wczytana_lista.split()
    ostateczna_lista = []
    for element in lista_znakow:
        ostateczna_lista.append(int(element))
    return ostateczna_lista

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

def party(): 
    A, B = wczytaj_liste()
    najwiekszy_dzielnik = NWD(A,B)
    odp = A*B//najwiekszy_dzielnik
    print(odp)

party()

Solution (Python):
def gcd(x,y):
    if x==0:
        return y
    elif y==0:
        return x
    
    if x<y:
        x,y = y,x
    return gcd(y, x%y)

A,B = map(int, input().split())
print( (A * B) // gcd(A,B))

Solution (Python):
def gcd(x,y):
    if x%y == 0:
        return y
    else:
        return gcd(y,x%y)

a,b = map(int,input().split())

print(int(a*b/gcd(a,b)))

Solution (Python):
import fractions
a, b = map(int, input().split())

def lcm(x, y):
  return (x * y) // fractions.gcd(x, y)

print(lcm(a, b))

Solution (Python):
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
import itertools
from itertools import permutations,combinations
import sys
import bisect
import string
import math
import time
import random
def I():
    return int(input())
def MI():
    return map(int,input().split())
def LI():
    return [int(i) for i in input().split()]
def LI_():
    return [int(i)-1 for i in input().split()]
def StoI():
    return [ord(i)-97 for i in input()]
def ItoS(nn):
    return chr(nn+97)
def GI(V,E,Directed=False,index=0):
    org_inp=[]
    g=[[] for i in range(n)]
    for i in range(E):
        inp=LI()
        org_inp.append(inp)
        if index==0:
            inp[0]-=1
            inp[1]-=1
        if len(inp)==2:
            a,b=inp
            g[a].append(b)
            if not Directed:
                g[b].append(a)
        elif len(inp)==3:
            a,b,c=inp
            aa=(inp[0],inp[2])
            bb=(inp[1],inp[2])
            g[a].append(bb)
            if not Directed:
                g[b].append(aa)
    return g,org_inp
def show(*inp,end='\n'):
    if show_flg:
        print(*inp,end=end)
YN=['Yes','No']
mo=10**9+7
inf=float('inf')
l_alp=string.ascii_lowercase
u_alp=string.ascii_uppercase
ts=time.time()

input=lambda: sys.stdin.readline().rstrip()

def ran_input():
    import random
    n=random.randint(4,16)
    rmin,rmax=1,10
    a=[random.randint(rmin,rmax) for _ in range(n)]
    return n,a

show_flg=False
show_flg=True


ans=0
a,b=LI()
import fractions
print(a*b//fractions.gcd(a,b))

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

Solution (Python):
A,B=map(int,input().split())
count=1
while True:
    if count*B % A == 0 :
        break
    else:
        count+=1
print(B*count)

Solution (Python):
a,b = map(int, input().split(" "))
a1,b1 = a,b
if a < b:
    tmp = b
    b = a
    a = tmp

r = a%b
while(r!=0):
    a = b
    b = r
    r = a%b

print(int(a1*b1/b))

Solution (Python):
import fractions
a,b = map(int, input().split())
tmp = fractions.gcd(a,b)
ans = a * b // tmp
print(ans)

Solution (Python):
import fractions

A, B = map(int, input().split())

def lcm(x, y):
    return (x * y) // fractions.gcd(x, y)

print(lcm(A, B))

Solution (Python):
A,B = map(int,input().split())
def gcd(a,b):
  if b == 0:
    return a
  return gcd(b,a % b)
def lcm(a,b):
  return a * b // gcd(a,b)
print(lcm(A,B))

Solution (Python):
import fractions

A,B=map(int,input().split())
f=A*B//fractions.gcd(A,B)
print(f)

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

Solution (Python):
def gcd(a, b):
    while b:
        a, b = b, a % b
    return a


def lcm(a, b):
    return a * b // gcd (a, b)
  
a,b=map(int,input().split())
print(lcm(a,b))

Solution (Python):

x, y = input().split()
x = int(x)
y = int(y)
if x < y:
    a = y
    b = x
else:
    a = x
    b = y

while b:
    a, b = b, a % b

print(x * y // a)

Solution (Python):
def gcd(a,b):
  if b==0:
    return a
  else:
    a = a%b
    return gcd(b,a)
def lcm(a,b):
  return a*b//gcd(a,b)

a,b = map(int,input().split())
if b > a:
  t = a
  a = b
  b = t
print(lcm(a,b))