Text Reverse |
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) |
Total Submission(s): 8371 Accepted Submission(s): 2271 |
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. |
Author
Ignatius.L
|
#include <stdio.h> void main() { int n,i=0,c=0,ac=0,bc=0; char a[1000],b[1000]; char t; scanf("%d\n",&n); for(;n>0;n--) { while(scanf("%c",&t)) { if(t!=' '&&t!='\n') a[ac++]=t; else { ac--; while(ac>=0) { b[bc++]=a[ac--]; } ac=0; if(t=='\n') { while(i<bc) { printf("%c",b[i++]); } printf("\n"); ac=0; i=0; bc=0; break; } else b[bc++]=' '; } } } } |
1.2.2
最新推荐文章于 2024-03-19 19:34:25 发布