알고리즘/BOJ

백준 1212번 8진수 2진수

꾸준함. 2018. 12. 1. 00:03

문제 링크입니다: https://www.acmicpc.net/problem/1212


간단한 진법 변환 문제였습니다.


#include <iostream>

#include <string>

using namespace std;

 

int main(void)

{

        ios_base::sync_with_stdio(0);

        cin.tie(0);

        string s;

        cin >> s;

 

        //0인 경우

        if (s == "0")

        {

                 cout << "0\n";

                 return 0;

        }

 

        for (int i = 0; i<s.length(); i++)

        {

                 switch (s[i] - '0')

                 {

                 case 0:

                         cout << "000";

                         break;

                 case 1:

                         if (!i)

                                 cout << "1";

                         else

                                 cout << "001";

                         break;

                 case 2:

                         if (!i)

                                 cout << "10";

                         else

                                 cout << "010";

                         break;

                 case 3:

                         if (!i)

                                 cout << "11";

                         else

                                 cout << "011";

                         break;

                 case 4:

                         cout << "100";

                         break;

                 case 5:

                         cout << "101";

                         break;

                 case 6:

                         cout << "110";

                         break;

                 case 7:

                         cout << "111";

                         break;

                 }

        }

        cout << "\n";

        return 0;

}


개발환경:Visual Studio 2017


지적, 조언, 질문 환영입니다! 댓글 남겨주세요~


반응형

'알고리즘 > BOJ' 카테고리의 다른 글

백준 3047번 ABC  (0) 2018.12.01
백준 1550번 16진수  (0) 2018.12.01
백준 2153번 소수 단어  (0) 2018.11.27
백준 11286번 절댓값 힙  (0) 2018.11.24
백준 11279번 최대 힙  (0) 2018.11.24