본문 바로가기

알고리즘

[프로그래머스] 기능개발

 

#include <string>
#include <vector>

using namespace std;

vector<int> solution(vector<int> progresses, vector<int> speeds) {
    
    vector<int> answer;
    
    int idx = 0;
    int days;
    int max = 0;
    int cnt = progresses.size();
    
    for(int i=0; i<cnt; i++){
        days = 0;
        while(progresses[i]<100){
            progresses[i] += speeds[i];
            days++;
        }
        if( max < days){
            answer.push_back(1);
            max = days;
        } else{
            answer.back()++;
        }
        
    }
  
    return answer;
}