Text Reverse

Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)

Total Submission(s) : 10 Accepted Submission(s) : 3

Font: Times New Roman | Verdana | Georgia

Font Size: ← →

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 '\n' 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>
char s[1010];
char s1[1010];
int main()
{
int T;
while(scanf("%d",&T)!=EOF)
{
getchar();
while(T--)
{
gets(s);
int i,j=0;int k=0;
for(i=0;s[i]!='\0';i++)
{
if(s[i]==' ')
{
for(j=i-1;j>=k;j--)
{
printf("%c",s[j]);
}
k=i+1;
printf("%c",s[i]);

}
}
for(i=strlen(s)-1;i>=k;i--)
{
printf("%c",s[i]);
}
printf("\n");
}
}
return 0;

}

代码二：

这代码我不知道为什么能过，别人的代码

#include<stdio.h>
#include<string.h>
int main()
{
int i,n,len,j,k,t;
char s1[1005],s2[100];
scanf("%d",&n);
getchar();
while(n--)
{
gets(s1);
len=strlen(s1);
for(i=0,j=0,t=0;i<len;i++)
{
if(s1[i]!=' ')
s2[j++]=s1[i]; /*保存单词*/
else
{
if(t>0) printf(" "); /*控制格式*/
for(k=j-1;k>=0;k--)
printf("%c",s2[k]); /*反转输出*/
j=0;
t++;
}
if(i==len-1) /*反转最后一个单词，这里要特别注意*/
{
printf(" ");
for(k=j-1;k>=0;k--)
printf("%c",s2[k]);
}
}
printf("\n");
}
return 0;
}

杭电acm1062Text Reverse相关推荐

杭电OJ-1062_Text Reverse
最近几天刷了些水题 HDU_OJ: 1001.2000-2011.2039.1720.1062. 输入输出格式控制 cout << setiosflags(ios::fixed)&l ...
杭电1214 圆桌会议
圆桌会议 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submi ...
杭电OJ分类题目（2）
原题出处:HDOJ Problem Index by Type,http://acm.hdu.edu.cn/typeclass.php 杭电OJ分类题目(2) HDU Water~~~ HDU 100 ...
杭电 HDU ACM 圆桌会议
圆桌会议 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submi ...
杭电多校第六场个人补题6 7 9 10 12
杭电多校第六场个人补题6 7 9 10 12 6 题意给定一棵有n结点的树,点权为1~n,求对所有结点子树的mex操作和的最大值思路其实就是从最底部开始网上找,由于0是唯一的一个,所欲最好给在最 ...
hdoj杭电问题分类
杭电上的题虽然多,但是一直苦于找不到问题分类,网页都是英文的,所以平时做题也没怎么看,今天仔细一看,问题分类竟然就在主页....做了那么久的题居然没发现,表示已经狗带..不要笑,不知道有没有像我一样傻 ...
杭电1042c语言循环,HDU杭电1052 Tian Ji - The Horse Racing答题报告
HDU杭电1052 Tian Ji -- The Horse Racing解题报告本人第一次写博客,希望各位大神多多指导与包涵,不足的地方还请指出,新手在此谢过啦!!! 题目描述: Time Lim ...
2022杭电多校（五）
2022杭电多校(五) 文章目录 2022杭电多校(五) 一.比赛小结二.题目分析及解法(基础题) 1003.Slipper 1006.BBQ 1007.Count Set 1010.Braggin ...
【杭电ACM】1097 A hard puzzle
[杭电ACM]1097 A hard puzzle http://acm.hdu.edu.cn/showproblem.php?pid=1097 先用int手写了算法结果竟然wrong answer ...

杭电acm1062Text Reverse