1- Given an input consisting of one or more sets of strings, followed by a final line containing only the value 0. Each set starts with a line containing an integer, k, which is the number of strings in the set, followed by k strings, one per line. For example, if your input is: Input = { "7", "Bo", "Jean", "Marybeth", "Kevin", "Claude", "William", "Pat", "6", "Jim", "Ben", "Annabelle", "Zoe", "Joey", "Frederick", "5", "John", "Billy", "Fran", "Stant", "Cece", "2", "Jones", "Bibi", "0" } Your output should look like that:
1- Given an input consisting of one or more sets of strings, followed by a final line containing only the value 0. Each set starts with a line containing an integer, k, which is the number of strings in the set, followed by k strings, one per line. For example, if your input is:
Input = { "7",
"Bo",
"Jean",
"Marybeth",
"Kevin",
"Claude",
"William",
"Pat",
"6",
"Jim",
"Ben",
"Annabelle",
"Zoe",
"Joey",
"Frederick",
"5",
"John",
"Billy",
"Fran",
"Stant",
"Cece",
"2",
"Jones",
"Bibi",
"0"
}
Your output should look like that:
2- Given the sorted input from question 1, write a new code such that the shorter strings go on the top and bottom and the longer strings sit in the middle. In other words, each pair of names belongs on opposite ends of the list, and the first name in the pair is always in the top part of the list. For example, in Set 1 below, Bob and Joe are the first pair, Jean and Kevin the second pair, etc.
Your output should look like the sample below.
|
Example input: |
Example output: |
|
7 |
SET 1 |
submit both parts cpp's
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 2 images
