Reversing a list of words (5)

Write a program that reads a sequence of words and prints, in reverse order, the second half of the list.

Input

Input consists of a sequence of words.

Output

If $n$ denotes the total number of words, print the $\lceil n/2 \rceil$ last words of the original sequence, in reverse order, and one per line.

Observation

For the sake of practice, use recursion (not arrays).

Problem information

Author: Unknown
Translator: Carlos Molina

Generation: 2026-01-25T11:07:58.997Z

© Jutge.org, 2006–2026.
https://jutge.org