1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
#include <string>
#include <vector>
#include <iostream>
#include <math.h>
using namespace std;

vector<int> solution(vector<int> progresses, vector<int> speeds) {
    vector<int> answers,days;
    int len= progresses.size();
    int val,day;
    for(int i=0;i<len;i++){
        val=100 - progresses[i];
        day = ceil((double)val/speeds[i]);
        cout << day<<endl;
        days.push_back(day);
    }
    for(int i=0;i<len;i++){
        if(i==0){ answers.push_back(1); continue;}
        if (days[i-1]  >= days[i]){
            days[i]=days[i-1];
            ++answers[answers.size()-1];
        }
        else{
            answers.push_back(1);
        }
    }
    return answers;
}