首页 > 代码库 > CDZSC_2015寒假新人（1）——基础 G
CDZSC_2015寒假新人（1）——基础 G
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.
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>using namespace std;int main(){#ifdef CDZSC_OFFLINE freopen("in.txt","r",stdin);#endif char str[1024],s[1024]; int len,i,j,t,p,flag; scanf("%d",&t); getchar(); while(t--) { cin.getline(str,1024); len=strlen(str); p=0,flag=0; for(i=0; i<len; i++) { if(str[i]!=‘ ‘) { s[p++]=str[i]; } else { if(flag==1) { printf(" "); } for(j=p-1; j>=0; j--) { printf("%c",s[j]); } flag=1; p=0; } } printf(" "); for(i=p-1; i>=0; i--) { printf("%c",s[i]); } printf("\n"); } return 0;}
CDZSC_2015寒假新人（1）——基础 G
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。