[Programmers] (그리디 or 완전탐색) Lv 2. 마법의 엘리베이터

https://school.programmers.co.kr/learn/courses/30/lessons/148653

프로그래머스

 

#include <string>
#include <vector>

using namespace std;

int solution(int storey) {
    // 24.12.18
    int answer = 0;
    while(storey)
    {
        int n = storey % 10;
        storey /= 10;
        
        bool isUp = (n == 5 && storey % 10 >= 5) || (n > 5);  
        answer += isUp ? (10 - n) : n; 
        storey += isUp ? 1 : 0;
    }
    return answer;
}

GitHub : https://github.com/developeSHG/Algorithm-Baekjoon_Programmers/commit/dd82378eb19cc42d3648c902159bdadd4fcc36ac

[level 2] Title: 마법의 엘리베이터, Time: 0.01 ms, Memory: 4.21 MB -BaekjoonHub · developeSHG/Algorithm-Baekjoon_Progra