This problem was used in the following GFU competitions:
GFU 2024 D2 Q8
During many of your more boring meetings you doodle and write nonsense on a notepad to pretend like you're paying attention to whoever is speaking. Recently, you've found that you really enjoy taking people's names and rearranging the letters to make them look funny. Going home after an all-hands-on- deck emergency safety meeting that you barely remember anything of, you decide you might as well waste even more time by writing a computer program that rearranges names automatically and does way faster than you ever possibly could during, say, an important company meeting.
The first input will be a single integer n that indicates the number of data sets that follow. Each data set will contain a random number of names of your coworkers separated by a comma. Each data set will contain at least two names of at minimum length of one. Some may include special characters.
For each data set, output the names of everyone on a line separated by a comma, but backwards. Keep character cases as they are in the input.
Example Input
2
Tim,Job,Bob
Franklin,Teeter,Mator
Example Output:
miT,boJ,boB
nilknarF,reteeT,rotaM
This is a pretty simple program... no real tips/tricks.