CF1038A.Equality

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

You are given a string $s$ of length $n$ , which consists only of the first $k$ letters of the Latin alphabet. All letters in string $s$ are uppercase.

A subsequence of string $s$ is a string that can be derived from $s$ by deleting some of its symbols without changing the order of the remaining symbols. For example, "ADE" and "BD" are subsequences of "ABCDE", but "DEA" is not.

A subsequence of $s$ called good if the number of occurences of each of the first $k$ letters of the alphabet is the same.

Find the length of the longest good subsequence of $s$ .

输入格式

The first line of the input contains integers $n$ ( $1\le n \le 10^5$ ) and $k$ ( $1 \le k \le 26$ ).

The second line of the input contains the string $s$ of length $n$ . String $s$ only contains uppercase letters from 'A' to the $k$ -th letter of Latin alphabet.

输出格式

Print the only integer — the length of the longest good subsequence of string $s$ .

输入输出样例

输入#1
```
9 3
ACAABCCAB
```
输出#1
```
6
```
输入#2
```
9 4
ABCABCABC
```
输出#2
```
0
```

说明/提示

In the first example, "ACBCAB" ("ACAABCCAB") is one of the subsequences that has the same frequency of 'A', 'B' and 'C'. Subsequence "CAB" also has the same frequency of these letters, but doesn't have the maximum possible length.

In the second example, none of the subsequences can have 'D', hence the answer is $0$ .

首页