本文共 1640 字，大约阅读时间需要 5 分钟。

B - Text Reverse

Ignatius has a peculiar way of writing words. When you receive a line of text from him, your task is to reverse all the words in that line and then output the result. This problem is straightforward but requires careful handling of input and output operations to ensure accuracy.

Input

The input consists of multiple test cases. Each test case is a single line of text containing several words. The line can have up to 1000 characters. The input begins with an integer T indicating the number of test cases. For each test case, you need to process the given line as per the problem requirements.

Output

For each test case, output the text after reversing all the words. Ensure that the output preserves the original structure and formatting of the input line, except for the words being reversed. Remove any leading or trailing spaces that may appear after processing.

Sample Input

3 olleh !dlrow m’I morf .udh I ekil .mca Sample Output hello world! I’m from hdu. I like acm.

Hint

Remember to use `getchar()` to read the newline character after the integer T. Then, use `gets()` to read each line and process it accordingly.

#include 
   
    using namespace std;int main() {    int n, i, len;    char a[1001];    cin >> n;    getchar();    while (n--) {        gets(a);        len = strlen(a);        i = 0;        while (i < len && a[i] != ' ') {            i++;        }        for (i--; i >= 0; i--) {            if (i == 0) {                printf("%c", a[i]);            } else if (a[i-1] == ' ') {                printf(" ");            }            printf("%c", a[i]);        }        printf("\n");    }    return 0;}
   

转载地址：http://xyoez.baihongyu.com/