-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathA.cpp
49 lines (41 loc) · 899 Bytes
/
A.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define mp make_pair
#define pb push_back
void solve(){
// Solve here
int n;
cin>>n;
string s;
cin>>s;
int x = (2*n)-2;
int one = count(s.begin(), s.end(), '1');
int zero = count(s.begin(), s.end(), '0');
if(one>=n) {
for(int i=0;i<n;i++) cout<<"1";
} else if(zero >= n) {
for(int i=0;i<n;i++) cout<<"0";
} else {
for(int i=0;i<n;i++) {
if(i%2==0) cout<<"0";
else cout<<"1";
}
}
cout<<endl;
}
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios::sync_with_stdio(0);
cout.tie(0);
cin.tie(0);
int t;
cin>>t;
while(t--){
solve();
}
return 0;
}