Text Reverse |
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) |
Total Submission(s): 5997 Accepted Submission(s): 1653 |
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. |
题目大意
给你一串字符串,把其中的单词逆序输出。
注意事项
要注意用getchar()来吸收换行符\n。
代码
<span style="font-size:18px;">#include<stdio.h>
#include<string.h>
char s[1100],c[1100];
int main()
{
int t;
int i,j,k,len;
scanf("%d",&t);
getchar();
while(t--)
{
gets(s);
len=strlen(s);
j=0;
for(i=0;i<len;i++)
{
if(s[i]!=' ')
{
c[j]=s[i];
j++;
}
else
{
for(k=j-1;k>=0;k--)
printf("%c",c[k]);
printf(" ");
j=0;
}
}
for(k=j-1;k>=0;k--)
printf("%c",c[k]);
printf("\n");
}
return 0;
}</span>