Karte
레이팅 미적용의견: 0
\(1^{st}\) round, October \(17^{th}\), 2015
Recently, Pero has been into robotics, so he decided to make a robot that checks whether a deck of
poker cards is complete.
He’s already done a fair share of wo\(rk - he\) wrote a programme that
recognizes the suits of the cards. For simplicity’s sake, we can assume that all cards have a suit and a
number.
The suit of the card is one of the characters P, K, H, T, and the number of the card is an integer
between 1 and 13. The robot labels each card in the format TXY where T is the suit and XY is the
number. If the card’s number consists of one digit, then \(X = 0\). For example, the card of suit P and
number 9 is labelled P09.
A complete deck has 52 cards in tot\(al - fo\)r each of the four suits there is exactly one card with a
number between 1 and 13.
The robot has read the labels of all the cards in the deck and combined them into the string S.
Help Pero finish the robot by writing a programme that reads the string made out of card labels and
outputs how many cards are missing for each suit.
If there are two exact same cards in the deck, output GRESKA (Croatian for ERROR).
The first and only line of input contains the string S (1 ≤ |S| ≤ 1000), containing all the card labels.
If there are two exact same cards in the deck, output “GRESKA”.
Otherwise, the first and only line of output must consist of 4 spa\(ce-se\)parated numbers: how many
cards of the suit P K, H, T are missing, respectively.
P10K10H10T0112 12 11 13
output
GRESKA
output
12 12 12 12Clarification of the first example: The robot has read one card of the suit P, 1 card of the suit K, 2
cards of the suit H.
Clarification of the second example: There were two cards of the suit H with number 2, so the
robot reports an error.
평가 및 의견
Karte
Log in to rate problems.
아직 의견이 없습니다. 자격이 된다면 위 양식에서 가장 먼저 평가해 보세요.
풀이 제출
Karte