백준
import sys
sys.stdin = open('input.txt')
input = sys.stdin.readline
n, m = map(int, input().split())
initial_n = n
initial_m = m
result = -1
while True:
if n >= m:
n %= m
if n == 0:
gcd = m
break
else:
m %= n
if m == 0:
gcd = n
break
lcm = initial_n * initial_m // gcd
print(gcd, lcm)
프로그래머스
from collections import deque
def solution(cacheSize, cities):
if cacheSize == 0:
return 5 * len(cities)
def lower(x):
return x.lower()
cities = list(map(lower, cities))
cache = deque()
result = 0
for city in cities:
if city in cache:
cache.remove(city)
cache.append(city)
result += 1
else:
result += 5
if len(cache) == cacheSize:
cache.popleft()
cache.append(city)
else:
cache.append(city)
return result
하루를 마치고
타임 스낵용으로 토론 배틀 아이디어가 나왔다.