Jojo, Lili and Bibi are playing together. Because they had just learned the alphabet, Jojo also proposed a game using the alphabet to hone and deepen their abilities. The game is a game of changing strings. Initially Jojo has an X string. The X string will be changed through several processes given by Jojo. The process is changing an alphabet Ai to Bi. Each alphabet can only be changed once. After all processes take place. Jojo just wants to find out how many characters Bi are in the string X. If the alphabet does not appear in the string, the character does not need to be displayed. The alphabet displayed must be ordered by alphabet. Lili and Bibi want to do it, but they doubt their answer, for that they ask for your help to make an answer for the Jojo game. Format Input The input will consist of several lines of input in ”testdata.in” file. First consists of T, the number of test cases. For each testcase consists of several lines. The first line consists of the X string, Jojo’s initial string. The second line consists of an integer N, the number of processes that must be done. For the next N lines the process must be done. Format Output The output consists of M lines, which contain the character and the amount of characters inside the new string, where M is the number of different characters that are in the string after the process. Constraints • 1 ≤ T ≤ 100 • 1 ≤ |X| ≤ 100 • 1 ≤ N ≤ 26 • The characters in the X string consist of the alphabet which is uppercase letters. Sample Input (testdata.in) 1 JOJO 2 J L O I Sample Output (standard output) I 2 L 2 Note In the test case, the ”JOJO” string will change to ”LILI” after 2 processes are carried out. Use C language and file processin
Jojo, Lili and Bibi are playing together. Because they had just learned the alphabet, Jojo also proposed a game using the alphabet to hone and deepen their abilities. The game is a game of changing strings. Initially Jojo has an X string. The X string will be changed through several processes given by Jojo. The process is changing an alphabet
Format Input
The input will consist of several lines of input in ”testdata.in” file. First consists of T, the number of test cases. For each testcase consists of several lines. The first line consists of the X string, Jojo’s initial string. The second line consists of an integer N, the number of processes that must be done. For the next N lines the process must be done.
Format Output
The output consists of M lines, which contain the character and the amount of characters inside the new string, where M is the number of different characters that are in the string after the process.
Constraints
• 1 ≤ T ≤ 100
• 1 ≤ |X| ≤ 100
• 1 ≤ N ≤ 26
• The characters in the
X string consist of the alphabet which is uppercase letters.
Sample Input (testdata.in) 1
JOJO 2
J L
O I
Sample Output (standard output)
I 2
L 2
Note
In the test case, the ”JOJO” string will change to ”LILI” after 2 processes are carried out.
Use C language and file processing.
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 1 images
