8-16 Tibetan poems and 8-16 Tibetan Poems

8-16 Tibetan poems and 8-16 Tibetan Poems

5-24 Tibetan Poems (20 points)

This question requires the compilation of a program to decrypt the Tibetan tail poems.

Input Format:

The input is a Chinese ending poem with four sentences in total. Each sentence is a line, but the sentence is not necessarily a long sentence. The sentence can contain at least one Chinese Character and at most nine Chinese characters. Note: a Chinese character occupies two bytes.

Output Format:

Extract the last Chinese character of each sentence and connect them to form a string and output it. At the same time, enter a line break at the end.

Input example:

Leisurely rural style, however, the heart is difficult to flat, and the orchid fragrance is more and more quiet

Output example:

Calm and calm

1. # Include <stdio. h>
2. # Include <stdlib. h>
3. # Include "math. h"
4. # Include "string. h"
6. Int main ()
7. {
8. Char * p [4], str [20];
9. Int I;
10. For (I = 0; I <= 3; I ++ ){
11. Gets (str );
12. P [I] = (char *) malloc (sizeof (str) + 1 );
13. Strcpy (p [I], str );
15. }
17. Int n;
19. For (I = 0; I <= 3; I ++ ){
20. N = strlen (p [I]);
21. Printf ("% s", p [I] + N-2 );
22. }
24. Return 0;
25. }