Codeforces Round #747 (Div. 2)C. Make Them Equal

最新推荐文章于 2024-10-16 00:00:43 发布

Evil_boy__

最新推荐文章于 2024-10-16 00:00:43 发布

阅读量196

点赞数

文章标签： html5 算法 html c++

本文链接：https://blog.csdn.net/m0_55682843/article/details/120742893

版权

题目要求将字符串s的所有字符变为字符c，通过选择一个数x，将所有不是x倍数的位置上的字符替换为c。求达到目标的最小操作数及对应的x值。对于每个测试用例，给出了字符串长度n和目标字符c，以及初始字符串s。当n为3到300000之间，所有n之和不超过300000。解答中指出，答案总是存在的，并给出了示例和解题思路。

摘要由CSDN通过智能技术生成

Theofanis has a string s1s2…sn and a character c. He wants to make all characters of the string equal to cc using the minimum number of operations.

In one operation he can choose a number xx (1≤x≤n) and for every position i, where i is not divisible by x, replace sisi with c.

Find the minimum number of operations required to make all the characters equal to cc and the xx-s that he should use in his operations.

Input

The first line contains a single integer tt (1≤t≤104) — the number of test cases.

The first line of each test case contains the integer nn (3≤n≤3⋅10^5) and a lowercase Latin letter c — the length of the string s and the character the resulting string should consist of.

The second line of each test case contains a string ss of lowercase Latin letters — the initial string.

It is guaranteed that the sum of nn over all test cases does not exceed 3⋅10^5.

Output

For each test case, firstly print one intege