bit가 눈 앞에서 왔다갔다

# from collections import deque import math progresses = [40, 93, 30, 55, 60, 65] speeds = [60, 1, 30, 5, 10, 7] # date = [ 1, / 7, 3, / 9, 4, 5 ] def solution(progresses, speeds): answer = [] # answer = [0 for i in range(100)] date = [] # 배포일 max = flag = 0 for _ in range(len(progresses)): date.append(math.ceil((100 - progresses.pop(0)) / speeds.pop(0))) # 1차 # for _ in range(len(date)): # tmp ..