## COCI '15 Contest 6 #1 Bela

View as PDF

Points: 5
Time limit: 1.0s
Memory limit: 64M

Problem type
Allowed languages
Ada, Assembly, Awk, Brain****, C, C#, C++, COBOL, CommonLisp, D, Dart, F#, Forth, Fortran, Go, Groovy, Haskell, Intercal, Java, JS, Kotlin, Lisp, Lua, Nim, ObjC, OCaml, Octave, Pascal, Perl, PHP, Pike, Prolog, Python, Racket, Ruby, Rust, Scala, Scheme, Sed, Swift, TCL, Text, Turing, VB, Zig

Young Mirko is a smart, but mischievous boy who often wanders around parks looking for new ideas. This time he's come across pensioners playing the card game Belote. They've invited him to help them determine the total number of points won in a single game.

Each card can be uniquely determined by its symbol and suit. A set of four cards is called a hand. In each game, one suit that "trumps" any other suit is called the dominant suit. The number of points in a single game is equal to the sum of scoring values of each card from each hand won in the game. Mirko has noticed that the pensioners have won hands and that suit was the dominant suit.

The scoring values of cards are given in the following table:

Card symbol Card scoring value
If dominant suit If not dominant suit
11 11
4 4
3 3
20 2
10 10
14 0
0 0
0 0

Write a programme that will determine and output the total number of points won in the game.

#### Input

The first line contains the number of hands and the value of suit from the task.

Each of the following lines contains the description of card (the first character being the label of the card , the second character being the suit of the card ).

#### Output

The first and only line of output must contain the number of points from the task.

#### Sample Input 1

2 S
TH
9C
KS
QS
JS
TD
JH

#### Sample Output 1

60

#### Sample Input 2

4 H
AH
KH
QH
JH
TH
9H
8H
7H
AS
KS
QS
JS
TS
9S
8S
7S

#### Sample Output 2

92

#### Clarification of the second example

The total number of points is equal to points.