프로그래머스 스택/큐

def solution(progresses, speeds):
    answer = []
    cnt = 0
    i = 0
    while i != len(progresses):
        while progresses[i] < 100:
            for q in range(i, len(progresses)):
                progresses[q] += speeds[q]
        for p in range(i, len(progresses)):
            if progresses[p] >= 100:
                cnt += 1
                if p == len(progresses) - 1:
                    answer.append(cnt)
                    cnt = 0
                    i = p
                    return answer
            else:
                answer.append(cnt)
                cnt = 0
                i = p
                break