-->https://programmers.co.kr/learn/courses/30/lessons/42586
def solution(progresses, speeds):
answer = []
stack = []
cnt = 0
for progress in progresses[::-1]:
stack.append(progress)
speeds = speeds[::-1]
while stack:
cnt = 0
for i in range(len(stack)):
stack[i] +=speeds[i]
length= len(stack)
for i in range(length):
if stack[-1]>=100:
stack.pop()
speeds.pop()
cnt+=1
if cnt!=0:
answer.append(cnt)
return answer