joj1146

1146: Word Reversal

---

Result	TIME Limit	MEMORY Limit	Run Times	AC Times	JUDGE
	3s	8192K	2585	676	Standard

For each list of words, output a line with each word reversed without changing the order of the words.

This problem contains multiple test cases!

The first line of a multiple input is an integer N, then a blank line followed by N input blocks. Each input block is in the format indicated in the problem description. There is a blank line between input blocks.

The output format consists of N output blocks. There is a blank line between output blocks.

Input

You will be given a number of test cases. The first line contains a positive integer indicating the number of cases to follow. Each case is given on a line containing a list of words separated by one space, and each word contains only uppercase and lowercase letters.

Output

For each test case, print the output on one line.

Sample Input

1

3
I am happy today
To be or not to be
I want to win the practice contest

Sample Output

I ma yppah yadot
oT eb ro ton ot eb
I tnaw ot niw eht ecitcarp tsetnoc

---

This problem is used for contest: 36 

---

Submit / Problem List / Status / Discuss

Problem Set with Online Judge System Version 3.12
Jilin University

Developed by skywind, SIYEE

 

 

 

 

 

 

 

#include<cstdio>
#include<string.h>
void Convert(char a[],int len)
{
    int i=0;
    int j=len-1;
    char temp;
    while(i<j)
    {
        temp=a[i];
        a[i]=a[j];
        a[j]=temp;
        i++;
        j--;
    }
}

void find(char a[])
{
    char b[10000];
    for(int i=0;a[i]!='\0';i++)
    {
        int j=0;
        while(a[i]!='\0'&&a[i]!=' ')
        {
            b[j]=a[i];
            j++;
            i++;
        }
        b[j]='\0';
        Convert(b,j);
        printf("%s",b);
        if(a[i]!='\0')printf(" ");
        if(a[i]=='\0')
        {
            printf("\n");
            return ;
        }
    }
}

int main()
{
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    int n,m;
    scanf("%d",&n);
    char p1[1000];
    for(int i=0;i<n;i++)
    {
        scanf("%d",&m);
        getchar();
        if(i!=0)printf("\n");
        for(int j=0;j<m;j++)
        {
            gets(p1);
            find (p1);
        }
    }
    return 0;
}