Keeping Score | 프로그래밍의 벗 PivotOJ
PivotOJ

Keeping Score

시간 제한: 1000ms메모리 제한: 128MB출처: CCC 2001 SeniorBOJ 6931

문제

In a card game, each player's hand is made up of 1313 cards. Each hand has a total point value determined by the number of cards that have a point value. The cards which are worth points are the Ace (44 points), King (33 points), Queen (22 points) and Jack (11 point). The other cards (2, 3, 4, 5, 6, 7, 8, 9, 10) have no point value.

There are four of each type of card, one in each of the four suits. The suits are called clubs (C), diamonds (D), hearts (H), and spades (S). As well, points are assigned for each suit which has a void (33 points), a singleton (22 points), or a doubleton (11 point). A void in a suit means that there are no cards of that suit (e.g. a hand with no spades). A singleton in a suit means that there is only one card in that suit (e.g. a hand with only one diamond). A doubleton in a suit means that there are only two cards in that suit.

Write a program to read a set of thirteen cards in the form of a string, then evaluate the number of points in the hand. The suits will appear in increasing alphabetical order. Within each suit there will be no duplicate cards.

The output is to be the hand and the point value shown in a table form as below. Your output should list the cards in the same order as the input. Note that 10 is represented by the character T in both the input and the output.

힌트

Note: your output does not need to match exactly. The spacing is up to you.

예제

예제 1

입력
C258TJKD69QAHSTJA
출력
Cards Dealt              Points
Clubs 2 5 8 T J K             4
Diamonds 6 9 Q A              6
Hearts                        3
Spades T J A                  5
                       Total 18

예제 2

입력
CAD578KAHAS47TQKA
출력
Cards Dealt              Points
Clubs A                       6
Diamonds 5 7 8 K A            7
Hearts A                      6
Spades 4 7 T Q K A            9
                       Total 28
이 문제는 채점 준비 중입니다. 테스트 데이터가 확보되면 제출이 가능합니다.