BestCoder Round #43 HDU5264 pog loves szh I

pog loves szh I

                                                              Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
                                                                                          Total Submission(s): 638    Accepted Submission(s): 383

Problem Description

Pog has lots of strings. And he always mixes two equal-length strings. For example, there are two strings: "abcd" and "efgh". After mixing, a new string "aebfcgdh" is coming.

However, szh thinks it is boring, so he reverses the second string, like changing "efgh" to "hgfe". Then mix them as usual, resulting in "ahbgcfde".

Now, here comes a problem. Pog is given a string after mixing by szh, but he wants to find the original two strings. 

Hint : In this question, it needs a linefeed at the end of line at hack time.

 

Input

The first line has an integer,  T(1≤T≤100) , indicating the number of cases.

Then follows  T  lines. Every lines has a string S, whose length is even and not more than  100 , and only consists of lower-case characters('a'~'z').

 

Output

For each cases, please output two lines, indicating two original strings.

 

Sample Input

  
  

   
   1
aabbca
  
  

 

Sample Output

  
  

   
   abc
aba

For example, there are two strings: "abcd" and "efgh". After mixing, a new string "aebfcgdh" is coming. 
  
  

 

Source

BestCoder Round #43 　　　　　　　　　　　　　　　 　　　　　　　　　　 　　　　　　　 　

出题人：读入一个串，第一个字符串首先将指针指向$0$，然后每次将指针$+2$输出即可。

第二个字符串首先将指针指向$n-1$,然后每次将指针$-2$，输出即可。 注意题目中描述

的是第二个字符串经过翻转才得到读入的字符串的。

#include
   
   
    
    
#include
    
    
     
     
#include
     
     
      
      
using namespace std;
char s[111];
int main()
{
    int t,i,l;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%s",s);
        l=strlen(s);
        for(i=0; i
      
      
       
       =0; i-=2)
            printf("%c",s[i]);
        puts("");
    }
    return 0;
}