Codeforces Round 806 (Div. 4) |
---|
Finished |
In an ICPC contest, balloons are distributed as follows:
Determine the total number of balloons that the teams received. Note that some problems may be solved by none of the teams.
The first line of the input contains an integer $$$t$$$ ($$$1 \leq t \leq 100$$$) — the number of testcases.
The first line of each test case contains an integer $$$n$$$ ($$$1 \leq n \leq 50$$$) — the length of the string.
The second line of each test case contains a string $$$s$$$ of length $$$n$$$ consisting of uppercase English letters, denoting the order of solved problems.
For each test case, output a single integer — the total number of balloons that the teams received.
63ABA1A3ORZ5BAAAA4BKPT10CODEFORCES
5 2 6 7 8 17
In the first test case, $$$5$$$ balloons are given out:
In the second test case, there is only one problem solved. The team who solved it receives $$$2$$$ balloons: one because they solved the problem, an an additional one because they are the first team to solve problem $$$\textsf{A}$$$.
Name |
---|