hdu 1062 Text Reverse

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.

题解：

  使用STL的string模拟即可，注意reverse函数的用法

代码：

#include <iostream>
#include <string>
#include <algorithm>
#include <cstring>
#include <cstdio>
using namespace std;

int main()
{
    int n;
    cin>>n;
    string tmp;
    string buff;
    getchar();
    while(n--)
    {
      getline(cin,tmp);
      buff="";
      int siz = tmp.size();
      //cout<<siz<<endl;
      for(int i=0;i<siz;i++)
      {

          if(tmp[i]!=' ')
             buff+=tmp[i];
          else{
             reverse(buff.begin(),buff.end());
             cout<<buff<<" ";buff="";
          }
      }
        reverse(buff.begin(),buff.end());
        cout<<buff<<endl;
    }
    return 0;
}