HDU-1062

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

原创最新推荐文章于 2021-02-21 22:28:50 发布 · 346 阅读

0 ·

CC 4.0 BY-SA版权

HDU 专栏收录该内容

24 篇文章

订阅专栏

本文介绍了一个简单的编程问题：如何逆序输出一行包含多个单词的文本。通过使用C++实现了一个程序，该程序能够读取一行文本，并将文本中的每个单词逆序输出。此程序适用于初学者了解字符串操作和基本编程技巧。

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

Text Reverse

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 26779 Accepted Submission(s): 10447

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.

Hint

Remember to use getchar() to read '\n' after the interger T, then you may use gets() to read a line and process it.

#include<iostream>
#include<string.h>
#define Maxn 1001
using namespace std;
void Fun(char a[],int v[],int &x)
{
int len=strlen(a);
for(int i=0;i<len;i++)
  if(a[i]==' '){v[x++]=i;}
}
int main()
{
int m,n;
int x;
int i,j;
bool flag=false;
int v[Maxn];
char a[Maxn],ch;
scanf("%d",&n);
ch=getchar();
while(n--)
{
  memset(v,0,sizeof(v));
  x=1;flag=false;
  gets(a);
  v[0]=-1;//默认第一个
  Fun(a,v,x);//找到空格的下标，用数组储存起来
  v[x]=strlen(a);//默认最后一个
  for(i=1;i<=x;i++)
  {
   j=v[i]-1;
   (flag)?printf(" "):flag=true;
   while(j!=v[i-1])
   {
    printf("%c",a[j--]);
   }
  }
  putchar(10);
}
return 0;
}