import math
from collections import deque

def solution(progresses, speeds):
    days = []
    answer=[]
    
    for i in range(len(progresses)):
        days.append(math.ceil((100-progresses[i])/speeds[i]))

    queue = deque([])
    count=0
    
    for i in range(len(days)):
        if not queue:
            queue.append(days[i])
            
        elif queue[0]<days[i]:
            queue.popleft()
            queue.append(days[i])
            answer.append(count)
            count=0
            
        count+=1
    answer.append(count)
    return answer