<jupyter_start><jupyter_text>2020년 7월 4일 토요일 BaekJoon - 최소공배수 (Python) 문제 : https://www.acmicpc.net/problem/1934 블로그 : https://somjang.tistory.com/entry/BaekJoon-1934%EB%B2%88-%EC%B5%9C%EC%86%8C%EA%B3%B5%EB%B0%B0%EC%88%98-Python  첫번째 시도<jupyter_code>def gcd(a, b):
    mod = a%b
    while mod > 0:
        a = b
        b = mod
        mod = a%b
    return b

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

loopNum = int(input())

for i in range(loopNum):
    inputNums = input()
    inputNums = inputNums.split()
    a = int(inputNums[0])
    b = int(inputNums[1])
    print(lcm(a, b))<jupyter_output><empty_output>
{'fraction_non_alphanumeric': 0.16721311475409836, 'fraction_numerical': 0.054098360655737705, 'mean_word_length': 3.213793103448276, 'pattern_counts': {'":': 0, '<': 5, '<?xml version=': 0, '>': 6, 'https://': 2, 'lorem ipsum': 0, 'www.': 1, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'chain_length': '1', 'dir': 'jupyter-structured-clean-dedup', 'id': '369926', 'license': 'MIT', 'n_tokens_mistral': 316, 'n_tokens_neox': 318, 'n_words': 49, 'path': 'DAY 101 ~ 200/DAY149_[BaekJoon] 최소공배수 (Python).ipynb', 'repo_name': 'SOMJANG/CODINGTEST_PRACTICE', 'size': '610'}