백준 11922번 BELA

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

문제에서 주어지는 표만 봐도 풀 수 있었던 문제였습니다.

#include <iostream>

#include <string>

using namespace std;

 

int main(void)

{

        ios_base::sync_with_stdio(0);

        cin.tie(0);

        int N;

        char B;

        cin >> N >> B;

 

        int result = 0;

        for (int i = 0; i < 4 * N; i++)

        {

                 string temp;

                 cin >> temp;

 

                 switch (temp[0])

                 {

                 case 'A':

                         result += 11;

                         break;

                 case 'K':

                         result += 4;

                         break;

                 case 'Q':

                         result += 3;

                         break;

                 case 'J':

                         //dominant

                         if (temp[1] == B)

                                 result += 20;

                         //not dominant

                         else

                                 result += 2;

                         break;

                 case 'T':

                         result += 10;

                         break;

                 case '9':

                         //dominant

                         if (temp[1] == B)

                                 result += 14;

                         break;

                 case '8':

                         break;

                 case '7':

                         break;

                 }

        }

        cout << result << "\n";

        return 0;

}

개발환경:Visual Studio 2017

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