문제 : https://www.acmicpc.net/problem/2609 첫번째 제출 코드 (정답) import sys A, B = map(int, sys.stdin.readline().split()) GCD = 0 LCM = 1 for i in range(1, min(A+1, B+1)): if A%i == 0 and B%i==0: GCD = i SET = set() for i in range(1, max(A+1, B+1)): if A%i == 0: SET.add(i) DividendA = A DividendB = B LCMList = [] divider = 2 while DividendA and DividendB: if DividendA % divider == 0 and DividendB % divi..
