Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 22877 Accepted Submission(s): 8805
#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]==‘\n‘)
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("\n");
}
return 0;
}
原文:http://www.cnblogs.com/tonghao/p/4989668.html