리셋 되지 말자

최대공약수, 최대공배수 - 관련문제 백준 2609import matha, b = map(int, input().split())print(math.gcd(a,b))print(math.lcm(a,b)) 입력속도 빠르게import sysn = int(sys.stdin.readline()) combinations, permutations, product, combinations_with_replacementfrom itertools import combinations, permutationsn, m = map(int, input().split())arr = list(map(int, input().split()))max_sum = 0for c in combinations(arr, 3)..