





def 			SCREAMING_SNAKE_CASE (			_UpperCAmelCase		,      _UpperCAmelCase					)     ->	int:
    return x if y == 0 else greatest_common_divisor(_UpperCAmelCase		,      x % y					)


def 			SCREAMING_SNAKE_CASE (			_UpperCAmelCase		,      _UpperCAmelCase					)     ->	int:
    return (x * y) // greatest_common_divisor(_UpperCAmelCase		,      _UpperCAmelCase					)


def 			SCREAMING_SNAKE_CASE (			_UpperCAmelCase = 20					)     ->	int:
    lowerCamelCase__       : Optional[Any]   					=						1
    for i in range(1		,      n + 1					):
        lowerCamelCase__       : Dict   					=						lcm(_UpperCAmelCase		,      _UpperCAmelCase					)
    return g


if __name__ == "__main__":
    print(F"""{solution() = }""")












def 			SCREAMING_SNAKE_CASE (			_UpperCAmelCase = 200					)     ->	int:
    lowerCamelCase__       : Dict   					=						[1, 2, 5, 10, 20, 50, 100, 200]
    lowerCamelCase__       : Union[str, Any]   					=						[0] * (pence + 1)
    lowerCamelCase__       : List[str]   					=						1  # base case: 1 way to make 0 pence

    for coin in coins:
        for i in range(_UpperCAmelCase		,      pence + 1		,      1					):
            number_of_ways[i] += number_of_ways[i - coin]
    return number_of_ways[pence]


if __name__ == "__main__":
    assert solution(2_00) == 7_36_82





