zoukankan      html  css  js  c++  java
  • hdu 1062 Text Reverse

    Text Reverse

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 22877    Accepted Submission(s): 8805


    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.
    Hint
    Remember to use getchar() to read ' ' after the interger T, then you may use gets() to read a line and process it.
     
    Author
    Ignatius.L
     
    #include<stdio.h>
    #include<string.h>
    #include<algorithm>
    #define MAX 1100
    using namespace std;
    int main()
    {
    	int n,m,j,i,t,k;
    	scanf("%d",&t);
    	char s[MAX];
    	char p[MAX];
    	getchar();
    	while(t--)
    	{
    		gets(s);
    		int len=strlen(s);
    		k=0;
    		for(i=0;i<len;i++)
    		{
    			if(s[i]!=' ')
    				p[k++]=s[i];
    			else 
    			{
    				for(j=k-1;j>=0;j--)
    			        printf("%c",p[j]);
    			        
    			    if(s[i+1]=='
    ')
    			    for(j=k-1;j>=0;j--)
    			        printf("%c",p[j]);
    			        
    			    if(s[i]==' ')
    				printf(" ");   
    			    k=0;
    			}
    		}
    		 for(j=k-1;j>=0;j--)
    			printf("%c",p[j]);
    		printf("
    ");
    	}
    	return 0;
    }
    

      

  • 相关阅读:
    CCF NOI1121 逆波兰表达式
    Vijos P1217 乒乓球【模拟+输入输出】
    Vijos P1304 回文数【回文+进制】
    NUC1041 数字三角形【DP】
    CCF NOI1070 汉诺塔游戏
    CCF NOI1069 分解因数
    CCF NOI1149 N皇后问题
    CCF NOI1153 素数环
    CCF NOI1170 质因数分解
    POJ NOI MATH-7832 最接近的分数
  • 原文地址:https://www.cnblogs.com/tonghao/p/4989668.html
Copyright © 2011-2022 走看看