hdu1062 Text Reverse

最新推荐文章于 2021-02-21 22:28:50 发布

sunshine668

最新推荐文章于 2021-02-21 22:28:50 发布

阅读量461

点赞数

分类专栏：字符串

字符串专栏收录该内容

9 篇文章

订阅专栏

本文介绍了一个简单的程序，该程序能够接收一行包含多个单词的文本，并将每个单词逆序输出。适用于初学者理解字符串操作和基本的输入输出流程。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Problem Description

Ignatius likes to write words in reverse way. Given a single line of text which is written by Ignatius, you should reverse all the words and then output them.

Input

The input contains several test cases. The first line of the input is a single integer T which is the number of test cases. T test cases follow.
Each test case contains a single line with several words. There will be at most 1000 characters in a line.

Output

For each test case, you should output the text which is processed.

Sample Input

3
olleh !dlrow
m'I morf .udh
I ekil .mca

Sample Output

hello world!
I'm from hdu.
I like acm.
#include<string>
#include<stdio.h>
#include<iostream>
using namespace std;

int main()
{
    string s;
    int l,i,j,k,n;
    cin >> n;
    getchar();
    while(n--)
    {
        getline(cin,s);
        l = s.length();
        for(k=0,j=-1;k<=l;k++)
        {
            if(s[k]==' '||k==l)
            {
                for(i=k-1;i>j;i--)
                {
                    cout << s[i];
                }
                if(k!=l)
                    cout <<' ';
                else
                    cout <<endl;
                j=k;
            }
        }
    }
    return 0;
}