1342B - Binary Period - CodeForces Solution


constructive algorithms strings *1100

Please click on ads to support us..

Python Code:

def inverse(x):
    if x == '1':
        return '0'
    return '1'


for _ in range(int(input())):
        t = input()

    if len(set(t)) == 1:
        print(t)
        continue
    
    ans = t[0]
    for i in t[1:]:
        if i == ans[-1]:
            ans += inverse(i) + i
        else:
            ans += i
    print(ans)

C++ Code:

#include<bits/stdc++.h>
using namespace std;
int main(){
    int t;
    cin>>t;
    while(t--){
        string s;
        cin>>s;
        int n=s.length();
        int z=0,o=0;
        for(int i=0;i<n;i++){
            if(s[i]=='0'){
                z++;
            }
            else{
                o++;
            }
        }
        if(o==n || z==n){
            cout<<s;
        }
        else{
            string p="10";
            string ans="";
            for(int i=1;i<=n;i++){
                ans+=p;
            }
            cout<<ans;
        }
        cout<<endl;
    }
}


Comments

Submit
0 Comments
More Questions

1475A - Odd Divisor
1454B - Unique Bid Auction
978C - Letters
501B - Misha and Changing Handles
1496A - Split it
1666L - Labyrinth
1294B - Collecting Packages
1642B - Power Walking
1424M - Ancient Language
600C - Make Palindrome
1669D - Colorful Stamp
1669B - Triple
1669A - Division
1669H - Maximal AND
1669E - 2-Letter Strings
483A - Counterexample
3C - Tic-tac-toe
1669F - Eating Candies
1323B - Count Subrectangles
991C - Candies
1463A - Dungeon
1671D - Insert a Progression
1671A - String Building
1671B - Consecutive Points Segment
1671C - Dolce Vita
1669G - Fall Down
4D - Mysterious Present
1316B - String Modification
1204A - BowWow and the Timetable
508B - Anton and currency you all know