Text Reverse
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 3625 Accepted Submission(s): 1348
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.
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
//本题虽然简单,但是特别容易presention error,要小心!我存储的时候又加上了一个空格,以便判断。每一行结尾不能多输出空格。#include<iostream>
#include<stack>
using namespace std;
char ch[1005];int main()
{
int n,i,j;
scanf("%d",&n);
getchar();
while(n--)
{
gets(ch);
int len=strlen(ch);
ch[len]=' ';
ch[len+1]='/0';
stack<char> s;
for(i=0;i<=strlen(ch);i++)
{
if(ch[i]==' '||ch[i]==' ')
{
while(!s.empty())
{
printf("%c",s.top());
s.pop();
}
if(i!=strlen(ch)-1)
printf("%c",ch[i]);
}
else
{
s.push(ch[i]);
}
}
printf("/n");
}
}