-
Notifications
You must be signed in to change notification settings - Fork 0
/
BinaryPeriod.cpp
68 lines (66 loc) · 1.07 KB
/
BinaryPeriod.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
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
/*
Author: Sanskar Agarwal
Nick: sanskarag
Birla Institute Of Technology, Mesra
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define endl "\n"
#define fast ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define F(i,a,b) for(ll i = (ll)(a); i <= (ll)(b); i++)
#define RF(i,a,b) for(ll i = (ll)(a); i >= (ll)(b); i--)
#define INF 100009
#define mod 1000000007
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#define ff first
#define ss second
#define test while(t--)solve();
void solve()
{
string t;
cin >> t;
string s;
set<char> se;
for (ll i = 0; i < t.size(); ++i)
{
se.insert(t[i]);
}
if (se.size() == 1)
{
cout << t << endl;
return;
}
ll n = t.size();
for (ll i = 0; i < n; ++i)
{
if (i == n - 1)
{
s += t[i];
break;
}
s += t[i];
if (t[i] == t[i + 1])
{
if (t[i] == '0')
s += '1';
else
s += '0';
}
}
cout << s << endl;
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("../input.txt", "r", stdin);
freopen("../output.txt", "w", stdout);
#endif
fast
ll t;
cin >> t;
// t=1;
test
return 0;
}