码迷,mamicode.com
首页 > 其他好文 > 详细

Text Reverse

时间:2015-06-05 19:08:09      阅读:112      评论:0      收藏:0      [点我收藏+]

标签:

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. 
         

 1 #include<iostream>
 2 using namespace std;
 3 int main()
 4 {
 5     int t,i=0,j=0;
 6     char word[1000];
 7     cin>>t;
 8     getchar();
 9     while(t--)
10     {
11         gets(word);
12         int i,s,p;
13         for(i=0;i<strlen(word);++i)
14         {
15             s=i;
16             while(word[i]!= &&word[i]!=\0) ++i;
17             p=i-1;
18             for(;p>=s;--p) cout<<word[p];
19             if(word[i]== )
20                 cout<<" ";
21         }
22         cout<<endl;
23     }
24     return 0;
25 }

 

Text Reverse

标签:

原文地址:http://www.cnblogs.com/wangmengmeng/p/4555203.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!