A15760 | $Equal Frequencies$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

Let's call a string balanced if all characters that are present in it appear the same number of times. For example, "coder", "appall", and "ttttttt" are balanced, while "wowwow" and "codeforces" are not. You are given a string $s$ of length $n$ consisting of lowercase English letters. Find a balanced string $t$ of the same length $n$ consisting of lowercase English letters that is different from the string $s$ in as few positions as possible. In other words, the number of indices $i$ such that $s_i \ne t_i$ should be as small as possible.

Each test contains multiple test cases. The first line contains the number of test cases $t$ ( $1 \le t \le 10^4$ ). The description of the test cases follows. Each test case consists of two lines. The first line contains a single integer $n$ ( $1 \le n \le 10^5$ ) — the length of the string $s$ . The second line contains the string $s$ of length $n$ consisting of lowercase English letters. It is guaranteed that the sum of $n$ over all test cases does not exceed $10^5$ .

For each test case, print the smallest number of positions where string $s$ and a balanced string $t$ can differ, followed by such a string $t$ . If there are multiple solutions, print any. It can be shown that at least one balanced string always exists.

输入 #1

4
5
hello
10
codeforces
5
eevee
6
appall

输出 #1

1
helno
2
codefofced
1
eeeee
0
appall

C++ 编辑器

输入

输出