A. String Similarity

传送门
A. String Similarity
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

A binary string is a string where each character is either 0 or 1. Two binary strings a
and b of equal length are similar, if they have the same character in some position (there exists an integer i such that ai=bi). For example:

10010 and 01111 are similar (they have the same character in position 4 );
10010 and 11111 are similar;
111 and 111 are similar;
0110 and 1001 are not similar.

You are given an integer n and a binary string s consisting of 2n−1 characters. Let’s denote s[l…r] as the contiguous substring of s starting with l-th character and ending with r-th character (in other words, s[l…r]=slsl+1sl+2…sr).
You have to construct a binary string w of length n which is similar to all of the following strings: s[1…n], s[2…n+1], s[3…n+2], …, s[n…2n−1]

Input

The first line contains a single integer t(1≤t≤1000) — the number of test cases.The first line of each test case contains a single integer n(1≤n≤50).
The second line of each test case contains the binary string s of length 2n−1. Each character si is either 0 or 1.

Output
For each test case, print the corresponding binary string w
of length n. If there are multiple such strings — print any of them. It can be shown that at least one string w meeting the constraints always exists.

Example
Input

4
1
1
3
00000
4
1110000
2
101

Output

1
000
1010
00

Note
The explanation of the sample case (equal characters in equal positions are bold):The first test case:
1 is similar to s[1…1]=1
The second test case: 000is similar to s[1…3]=000;
000is similar to s[2…4]=000;
000is similar to s[3…5]=000
The third test case:1010is similar to s[1…4]=1110;
1010is similar to s[2…5]=1100;
1010is similar to s[3…6]=1000;
1010is similar to s[4…7]=0000
The fourth test case: 00is similar to s[1…2]=10
00is similar to s[2…3]=01

题意：输入t组样例，输入数字n，后输入含有0与1组成大小为2n-1数组.输出一个大小为n的数组，使得输入的数组从1到2n-1依次每n个为一组，每一组与输出的数组为相似数组（只需在同一个坐标含有同一个相同的元素）。

思路：只需找出输入大小为2n-1的数组中包含0与1，谁多；谁多就输出谁即可，因为2n-1为奇数，具体看代码。

AC代码

#include<algorithm>
#include<cstring>
#include<cstdio>
using namespace std;
int main()
{
    int t,n,sum1,sum2;
    cin>>t;
    char a[1000];
    while(t--)
    {
        cin>>n;
        int m=2*n-1;
        sum1=0,sum2=0;
        for(int i=0;i<m;i++)
        {
            cin>>a[i];
            if(a[i]=='0')
                sum1++;
            else sum2++;
        }
               if(sum1>sum2)
                    for(int i=0;i<n;i++)
                {
                    printf("0");}
                else
                    for(int i=0;i<n;i++)
                {printf("1");}

        printf("\n");
    }return 0;
}