Editorial for COCI '16 Contest 4 #1 Bridž

Remember to use this editorial only when stuck, and not to copy-paste code from it. Please be respectful to the problem author and editorialist.
Submitting an official solution before solving the problem yourself is a bannable offence.

In order to solve this task, we needed to count the number of appearances of characters A, K, Q, and J in all cards K_i together.

The solution of the task R is given in the following formula:

\displaystyle R = 4A+3K+2Q+J


There are no comments at the moment.