only. Do not copy. Correct code will upvoted else downvote. Theofanis has a string s1s2… sn and a character c. He needs to make all characters of the string equivalent to c utilizing the base number of activities. In one activity he can pick a number x (1≤x≤n) and for each position I, where I isn't separable by x, supplant
C++ only. Do not copy. Correct code will upvoted else downvote.
Theofanis has a string s1s2… sn and a character c. He needs to make all characters of the string equivalent to c utilizing the base number of activities.
In one activity he can pick a number x (1≤x≤n) and for each position I, where I isn't separable by x, supplant si with c.
Track down the base number of activities needed to make every one of the characters equivalent to c and the x-s that he should use in his tasks.
Input
The principal line contains a solitary integer t (1≤t≤104) — the number of experiments.
The main line of each experiment contains the integer n (3≤n≤3⋅105) and a lowercase Latin letter c — the length of the string s and the character the subsequent string should comprise of.
The second line of each experiment contains a string s of lowercase Latin letters — the underlying string.
It is ensured that the amount of n over all experiments doesn't surpass 3⋅105.
Output
For each experiment, first and foremost print one integer m — the base number of tasks needed to make every one of the characters equivalent to c.
Then, print m integers x1,x2,… ,xm (1≤xj≤n) — the x-s that ought to be utilized in the request they are given.
It tends to be demonstrated that under given limitations, an answer consistently exists. In case there are various replies, print any
Step by step
Solved in 3 steps with 1 images
