zoukankan      html  css  js  c++  java
  • Text Reverse

    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 '
    ' 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]!='') ++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 }
  • 相关阅读:
    卡特兰数
    Tree
    关于树上DP的转移方式与复杂度证明
    Tarjan进阶
    排队
    Perm 排列计数
    [bzoj1227]虔诚的墓主人
    [BZOJ1195]最短母串
    ValueError: Variable vgg_16/conv1/conv1_1/weights already exists, disallowed
    《链家网技术架构的演进之路》读后感
  • 原文地址:https://www.cnblogs.com/wangmengmeng/p/4555203.html
Copyright © 2011-2022 走看看