Problem:


Score : 200 points

Problem Statement

Snuke signed up for a new website which holds programming competitions.
He worried that he might forget his password, and he took notes of it.
Since directly recording his password would cause him trouble if stolen,
he took two notes: one contains the characters at the odd-numbered positions, and the other contains the characters at the even-numbered positions.

You are given two strings O and E. O contains the characters at the odd-numbered positions retaining their relative order, and E contains the characters at the even-numbered positions retaining their relative order.
Restore the original password.

Constraints

O and E consists of lowercase English letters (a - z).

1 \leq |O|,|E| \leq 50

|O| - |E| is either 0 or 1.

Input

Input is given from Standard Input in the following format:

O
E

Output

Print the original password.

Sample Input 1

xyz
abc

Sample Output 1

xaybzc

The original password is xaybzc. Extracting the characters at the odd-numbered positions results in xyz, and extracting the characters at the even-numbered positions results in abc.

Sample Input 2

atcoderbeginnercontest
atcoderregularcontest

Sample Output 2

aattccooddeerrbreeggiunlnaerrccoonntteesstt



Sample input:
xyz
abc


Sample output:
xaybzc

Submission status: Accepted

Solution code:
o = input()
e = input()
for i in range(len(e)):
  print(o[i] + e[i], end='')
if len(o) > len(e):
  print(o[-1])
else:
  print('')

Submission status: Accepted

Solution code:
from collections import deque
O = deque(list(input()))
E = deque(list(input()))
Ans = []

for i in range(len(O) + len(E)):
    if i % 2 == 0:
        Ans.append(O.popleft())
    else:
        Ans.append(E.popleft())

print(''.join(Ans))

Submission status: Accepted

Solution code:
O=input()
E=input()
ans=[]
for i in range(len(O)+len(E)):
	if i%2==0:
		ans.append(O[i//2])
	else:
		ans.append(E[i//2])
ans=''.join(ans)
print(ans)

Submission status: Accepted

Solution code:
O = input()
E = input()

ans = ""
for o,e in zip(O,E):
    ans += o
    ans += e

if len(O) > len(E):
    ans += O[-1]
print(ans)

Submission status: Accepted

Solution code:
o = input()
e = input()
string = len(o) + len(e)
result = ''
c = 0
for i in range(string):
    try:
        result += o[i]
    except:
        pass
    try:
        result += e[i]
    except:
        pass
print(result)

Submission status: Accepted

Solution code:
o = input()
e = input()
ans = ''
for i, j in zip(o, e):
    ans += i + j
    
if len(o) == len(e):
    print(ans)
else:
    print(ans + o[-1])

Submission status: Accepted

Solution code:
s = input()
t = input()
n = len(t)
for i in range(n):
  print(s[i], end="")
  print(t[i], end="")
if len(s) != len(t):
  print(s[-1], end="")
print()

Submission status: Accepted

Solution code:
o = input()
e = input()
lo = len(o)
le = len(e)

if lo == le: l = lo
elif lo >= le: l = le
else: l = lo

s = ""
for i in range(l):
        s += o[i]
        s += e[i]
if lo - le == 1:
    s += o[-1]
print(s)

Submission status: Accepted

Solution code:
o = list(input())
e = list(input())

pw = []

for i in range(len(o)+len(e)):
    if i % 2 == 0:
        pw.append(o[i//2])
    else:
        pw.append(e[(i-1)//2])

print("".join(pw))

Submission status: Accepted

Solution code:
def resolve():
    o = input()
    e = input()

    length = len(o) + len(e)

    ans = str()
    oe = int()
    for i in range(1, length + 1):
        if i % 2 == 0:
            oe = int(i / 2) - 1
            ans += e[oe]
        if i % 2 == 1:
            oe = int((i-1) / 2)
            ans += o[oe]
    print(ans)
resolve()

Submission status: Accepted

Solution code:
O = input()
E = input()

for i in range(len(E)-1):
    print(O[i]+E[i],end='')
if len(O) == len(E):
    print(O[len(O)-1]+E[len(E)-1])
else:
    print(O[len(O)-2]+E[len(E)-1]+O[len(O)-1])

Submission status: Accepted

Solution code:
# coding: utf-8
O = input()
E = input()

for o, e in zip(O, E):
    print(o + e, end="")
if abs(len(O) - len(E)) == 1:
    print(O[-1])

Submission status: Accepted

Solution code:
O = input()
E = input() + " "
print("".join(o + e for o, e in zip(O, E)).strip())

Submission status: Accepted

Solution code:
sa = input()
sb = input()
for ca, cb in zip(sa, sb):
	print(ca, cb, sep='', end='')
if len(sa) != len(sb):
	print(sa[-1])

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

import sys
# import time
# import math
# import numpy as np
# import scipy.sparse.csgraph as cs            # csgraph_from_dense(ndarray, null_value=inf), bellman_ford(G, return_predecessors=True), dijkstra, floyd_warshall
# import random                                # random, uniform, randint, randrange, shuffle, sample
# import string                                # ascii_lowercase, ascii_uppercase, ascii_letters, digits, hexdigits
# import re                                    # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from collections import deque                # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict          # subclass of dict. defaultdict(facroty)
# from collections import Counter              # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from datetime import date, datetime          # date.today(), date(year,month,day) => date obj; datetime.now(), datetime(year,month,day,hour,second,microsecond) => datetime obj; subtraction => timedelta obj
# from datetime.datetime import strptime       # strptime('2019/01/01 10:05:20', '%Y/%m/%d/ %H:%M:%S') returns datetime obj
# from datetime import timedelta               # td.days, td.seconds, td.microseconds, td.total_seconds(). abs function is also available.
# from copy import copy, deepcopy              # use deepcopy to copy multi-dimentional matrix without reference
# from functools import reduce                 # reduce(f, iter[, init])
# from functools import lru_cache              # @lrucache ...arguments of functions should be able to be keys of dict (e.g. list is not allowed)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import nlargest, nsmallest        # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
# from itertools import count, cycle, repeat   # count(start[,step]), cycle(iter), repeat(elm[,n])
# from itertools import groupby                # [(k, list(g)) for k, g in groupby('000112')] returns [('0',['0','0','0']), ('1',['1','1']), ('2',['2'])]
# from itertools import starmap                # starmap(pow, [[2,5], [3,2]]) returns [32, 9]
# from itertools import product, permutations  # product(iter, repeat=n), permutations(iter[,r])
# from itertools import combinations, combinations_with_replacement
# from itertools import accumulate             # accumulate(iter[, f])
# from operator import itemgetter              # itemgetter(1), itemgetter('key')
# from fractions import gcd                    # for Python 3.4 (previous contest @AtCoder)



def main():
    mod = 1000000007                # 10^9+7
    inf = float('inf')              # sys.float_info.max = 1.79...e+308
    # inf = 2 ** 64 - 1             # (for fast JIT compile in PyPy) 1.84...e+19
    sys.setrecursionlimit(10**6)    # 1000 -> 1000000
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    
    o = input()
    e = input()

    s = ''
    for i in range(len(e)):
        s += o[i]
        s += e[i]
    
    if len(o) > len(e):
        s += o[-1]
    print(s)
    


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
O = input()
E = input()
ans = ''
for i in range(len(E)):
  ans += O[i] + E[i]
  
if len(O) - len(E):
  ans += O[-1]

print(ans)

Submission status: Accepted

Solution code:
A = input()
B = input()
ans = ''
if len(A) == len(B):
    for i in range(len(A)):
        ans += A[i] + B[i]
else:
    for i in range(len(B)):
        ans += A[i] + B[i]
    ans += A[-1]

print(ans)

Submission status: Accepted

Solution code:
A=list(input())
B=list(input())
C=list()
if len(A)==len(B):
  for i in range(len(A)):
    C.append(A[i]+B[i])
  print(''.join(C))
else:
  for i in range(len(B)):
    C.append(A[i]+B[i])
  C.append(A[-1])
  print(''.join(C))

Submission status: Accepted

Solution code:
O=input()
E=input()
a=[]

for i in range(len(O)+len(E)):
	if i%2==0:
		a.append(O[int(i/2)])
	else:
		a.append(E[int((i-1)/2)])
print(''.join(a))

Submission status: Accepted

Solution code:
O = list(input())
E = list(input()) + ['']
print(*[O+E for O,E in zip(O,E)], sep='')

Submission status: Accepted

Solution code:
o = input()
e = input()

ans = ''
if len(o) == len(e):
    for i in range(len(o)):
        ans += o[i] + e[i]
elif len(o) > len(e):
    for i in range(len(e)):
        ans += o[i] + e[i]
    ans += o[-1]
else:
    for i in range(len(o)):
        ans += o[i] + e[i]
    ans += e[-1]

print(ans)

Submission status: Accepted

Solution code:
o = input()
e = input()
x = []
o = list(o)
e = list(e)

for i in range(0,max(len(o),len(e))):
  #print(x)
  if(len(o) != 0 and len(e) != 0):
    x.append(o[0])
    del o[0]
    x.append(e[0])
    del e[0]
  elif(len(o) != 0 and len(e) == 0):
    x.append(o[0])
    del o[0]
  elif(len(o) == 0 and len(e) != 0):
    x.append(e[0])
    del e[0]
print(''.join(x))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys

import fractions
import copy
import bisect
import math
import numpy as np
import itertools
from itertools import combinations_with_replacement
#import math#数学的計算はこれでいける。普通に0.5乗しても計算可能
#w=input()
from operator import itemgetter
from sys import stdin
#input = sys.stdin.readline#こっちの方が入力が早いが使える時に使っていこう
from operator import mul
from functools import reduce
from collections import Counter
#from collections import deque

#input = stdin.readline


j=0
k=0
n=3
r=1
a=[0]
#n=int(input())
#r=int(input())
#print(M)
#A=int(input())
#B=int(input())
#print(N)
"1行1つの整数を入力を取得し、整数と取得する"


#number_list=list(map(int, input().split(" ")))#数字の時
#print(number_list)
"12 21 332 とか入力する時に使う"
"1行に複数の整数の入力を取得し、整数として扱う"

'''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''
#メモ
for i in number_list:#こっちの方がrage使うより早いらしい
    print(number_list[i-1])#

'''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''

'''
x=[]
y=[]
for i in range(N):
    x1, y1=[int(i) for i in input().split()]
    x.append(x1)
    y.append(y1)
print(x)
print(y)
"複数行に2数値を入力する形式 x座標とy座標を入力するイメージ"
'''

'''
mixlist=[]
for i in range(N):
    a,b=input().split()
    mixlist.append((int(a),b))
print(mixlist)
"複数行にintとstrを複合して入力するやつ，今回はリスト一つで処理している"
'''

'''
#array=[input().split()for i in range(N)]
#print(type(array[0][0]))
#print(array)
"正方行列にstr型の値を入力"
'''

#brray=[list(map(int, input().split(" ")))for i in range(N)]
#print(type(brray[0][0]))
#print(brray)
'''
入力
1 2
4 5
7 8
出力結果
[[1, 2], [4, 5], [7, 8]]
'''
"列数に関して自由度の高いint型の値を入力するタイプの行列"
#以下に別解を記載
#N, M = [int(i) for i in input().split()]
'''
table = [[int(i) for i in input().split()] for m in range(m)]

print(type(N))
print(N)
print(type(M))
print(M)

print(type(table))
print(table)
'''




#s=input()
#a=[int(i) for i in s]
#print(a[0])
#print([a])
#単数値．桁ごとに分割したい．入力と出力は以下の通り
#イメージとして1桁ごとにリストに値を入れているかんじ
#intを取ると文字列分解に使える
'''
入力
1234
出力
1
[[1, 2, 3, 4]]
'''




'''
word_list= input().split(" ")
print(word_list[0])
"連続文字列の入力"
"qw er ty とかの入力に使う"
"入力すると空白で区切ったところでlistの番号が与えられる"
'''



'''
A, B, C=stdin.readline().rstrip().split()#str style 何個でもいけることが多い
print(A)
"リストではなく独立したstr型を入れるなら以下のやり方でOK"
'''


#a= stdin.readline().rstrip()
#print(a.upper())
"aという変数に入っているものを大文字にして出力"


#a,b=map(int, input().split())  #int style 複数数値入力　「A B」みたいなスペース空いた入力のとき

#なんかうまく入力されるけど
#a=[[int(i) for i in 1.strip()]for 1 in sys.stdin]
#a = [[int(c) for c in l.strip()] for l in sys.stdin]]
#print(a)
#複数行の数値を入力して正方行列を作成


##############################################################################################
##############################################################################################
#under this line explains example calculation



'''
コンビネーションの組み合わせの中身を出力する形式
for i in itertools.combinations(brray, 2)
combinationsをpermutationsにすれば順列になる
今回なら(abc133B)
入力
1 2
5 5
-2 8
出力
[[1, 2], [5, 5], [-2, 8]]
もちろん一次元リストでも使えるし
何よりiもリストのように使えるので便利
'''

#nCr combination
'''
def cmb(n,r):
    #When n < r , this function isn't valid
    r= min(n-r,r)
    #print(n,r)
    if r == 0: return 1
    over = reduce(mul, range(n, n-r, -1))
    #flochart mul(n,n-1)=x
    #next     mul(x,n-2)........(n-r+1,n-r)
    #mul read a,b and returns a*b

    under = reduce(mul, range(1, r+1))
    #print(over, under)
    #reduce is applied mul(1,2)=2
    #next   mul(2,3)=6
    #next   mul(6,4)=4.........last(r!,r+1)=r+1!

    return over // under
    #// is integer divide
    #calc example 5C2
    #over=5*4*3
    #under=3*2*1
a = cmb(n, r)
#print(a)
'''

'''
import itertools
from itertools import combinations_with_replacement

combinationについて
以下の違いを意識しよう
combinations() p, r 長さrのタプル列、ソートされた順で重複なし

combinations_with_replacement() p, r 長さrのタプル列、ソートされた順で重複あり


使用例 　　　　　　　　　　　                  出力　　
combinations('ABCD', 2)　　　　　　　　　　　　AB AC AD BC BD CD

combinations_with_replacement('ABCD', 2)　　 AA AB AC AD BB BC BD CC CD DD
'''



'''
#集計
#example
#a=[2,2,2,3,4,3,1,2,1,3,1,2,1,2,2,1,2,1]
#a=Counter(a)
for i in a.most_common(n):print(i)
#most_common()メソッドは、出現回数が多い要素順にCounterオブジェクトを並び替えます。
#引数にint型の数字nを設定した場合は、出現回数が高い上位ｎ個の要素を返します。
#何も設定しなければ、コンテナ型にあるすべての要素を出現回数の順番に並び替えたタプル型オブジェクトを返します。
#out put
#(2, 8)
 #(1, 6)
#(3, 3)
#(4, 1)
'''


#二部探索(binary search)
#A = [1, 2, 3, 3, 3, 4, 4, 6, 6, 6, 6]
#print(A)
#index = bisect.bisect_left(A, 5) # 7 最も左(前)の挿入箇所が返ってきている
#A.insert(index, 5)
#print(index)
#print(A)
'''
bisect.bisect_left(a, x, lo=0, h=len(a))
引数
a: ソート済みリスト
x: 挿入したい値
lo: 探索範囲の下限
hi: 探索範囲の上限
(lo, hiはスライスと同様の指定方法)
bisect_leftはソートされたリストaに対して順序を保ったままxを挿入できる箇所を探索します。leftが示す通り、aにすでにxが存在している場合は、挿入箇所は既存のxよりも左側になります。また、lo, hiを指定することで探索範囲を絞り込むことも可能です。デフォルトはaの全体が探索対象です。
'''

'''
素数の判定
'''


def is_prime(n):
    if n == 1: return False

    for k in range(2, int(np.sqrt(n)) + 1):
        #sqrt(n)+1以上は考えて約数はないので却下
        if n % k == 0:
            return False
            #割り切れたらFalse
    return True


'''
npのmaxとmaximumの違い
xs = np.array([1, -2, 3])
np.max(xs, 0)
この出力は3となります．[1, -2, 3]と0の4つの数字のうち，最も大きい値を出力します．

一方で，[max(1, 0), max(-2, 0), max(3, 0)]を出力したい時があります．
その時は，numpyのmaximum関数を用います．

xs = np.array([1, -2, 3])
np.maximum(xs, 0)  # [1, 0, 3]

'''

def factorial(x, mod=10**9+7):
    # x!
    # 階乗
    # ex) factorial(5) = 120
    tmp = 1
    for i in range(1, x+1):
        tmp = (tmp * i) % mod
    return tmp
    '''
    Basically, when you do a**d % n, you actually have to calculate a**d, which could be quite large.
    But there are ways of computing a**d % n without having to compute a**d itself, and that is what pow does.
    '''


########################################################################
########################################################################
#b2=a[:]  #1次元のときはコピーはこれで良い
#print(b2)

#a= [[0]*3 for i in range(5)] #2次元配列はこう準備、[[0]*3]*5だとだめ
#b3=copy.deepcopy(a)  #2次元配列はこうコピーする
#print(b3)

'''
ascii_letters = 'abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ'
ascii_lowercase = 'abcdefghijklmnopqrstuvwxyz'
ascii_uppercase = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
digits = '0123456789'
hexdigits = '0123456789abcdefABCDEF'
letters = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuv...\xaf\xb0...
lowercase = 'abcdefghijklmnopqrstuvwxyz'
octdigits = '01234567'
printable = '0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTU...
punctuation = '!"#$%&\'()*+,-./:;<=>?@[\\]^_`{|}~'
uppercase = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
whitespace = '\t\n\x0b\x0c\r '
'''
'''
引数endに任意の文字列を指定すると、その文字列が改行の代わりに最後に挿入される。例えば連続するprint()の出力を改行なしで単純に連結したい場合は空文字列''を指定すればよい。

print('abc', end='---')
print('xyz')
# abc---xyz

print('abc', end='')
print('xyz')
# abcxyz
source: print_basic.py
なお、デフォルトで改行されるのは引数endのデフォルト値が改行文字'\n'に設定されているから。
'''

def main():
    n=3
    steps=0
    state=0
    w=1
    j=0
    k=0
    #lenを変数に置くと事故るから注意
    #n=int(input())
    #a,b=input().split(" ")#a,bがともに文字列のとき
    #a,b=map(int, input().split(" "))
    #mapでとってもstrで変換すればappend可能
    s=input()
    odd=[i for i in s]#int(i)にすれば数字も行ける
    p=input()
    even=[i for i in p]#int(i)にすれば数字も
    #n=len(odd)+len(even)
    n=len(odd)
    #print(odd)
    #print(even)
    ss=["a"]*n
    #print(ss)

    if len(odd)==len(even):
     for i in range(n):
        #print(i)
        ss[i]=odd[i]+even[i]
    #if len(odd)>len(even):
    else:
     for i in range(n-1):
        #print(i)
        ss[i]=odd[i]+even[i]
     ss[n-1]=(odd[-1])
    print("".join(ss))
    #nl=list(map(int, input().split(" ")))#数字の時
    #print(a)
    #brray=[list(map(int, input().split(" ")))for i in range(N)]
    #print(brray)


    for i in range(1,n+1,2):#これで1個飛ばしループになる
     pass
     #print(i)

    l = ['aaa', 'bbb', 'ccc']
    x=l.index('aaa')#ある要素のインデックス番号を取得
    #s = ''.join(l)
    #s = " ".join(map(str,a))#スペースを空ける時はこう
    #print(s)
    # aaabbbccc

    #if state in known_states and not flag: # state => 2 steps => 5
        #こうやってある要素がリストの中にあるか探すのか
    #print(f'steps: {steps}, state: {state}')
    #こう書いてあるとデバックしやすい

    #dp= [[0]*3 for i in range(5)]#列　行
    #dp用の0の入ったやつ
    #dp= [[0]*(w+1) for i in range(n+1)]#0からwまでのw+1回計算するから
    #print(dp)＃初期条件が入る分計算回数+1列分必要(この場合は判断すべきものの数)
    DP = np.zeros(w+1, dtype=int)#これでも一次元リストが作れる
    exdp=np.zeros((3,4)) # ３×４の２次元配列を生成。2次元ならこう
    #dtypeは指定しないとfloatになる
    #for i in range(n):#ちょっとした入力に便利
    #    a, b = map(int, input().split())
        #dp[i][0] += [a]
        #これだとintとlistをつなぐことになって不適
    #    dp[i] += [a]
    #    dp[i] += [b]
        #これはうまくいく
        #やり方はいろいろあるということ
    #print(dp)


    #brray=[list(map(int, input().split(" ")))for i in range(N)
    #print(brray)



    '''
    入力
    1234
    出力
    [1, 2, 3, 4]
    '''
    pin_l=["x" for i in range(10)]#内包表記に慣れろ
    #print(pin_l)

    ls = ["a", "b", "c", "d", "e"]


    #print(ls[2:5])
    #スライスでの取得

    #print(ls[:-3])
    #一番左端から右から3番目より左まで取得

    #print(ls[:4:2])
    #スライスで1個飛ばしで取得
    #ないときは左端スタート
    #始点のインデックス番号 : 終点のインデックス番号 : スキップする数+1
    #print(ls[::2])
    '''
    lsというリストの場合に、1つ飛びの値を取得したい場合には
    ls[::2]
    のようにします。こうすると、
    ["a", "c", "d"]と出力される
    '''

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
o = input()
e = input()
if len(o)!=len(e):
    e+=" "
password=""
for i in range(len(o)):
    password+=o[i]+e[i]
    
print(password)

Submission status: Accepted

Solution code:
O=input()
E=input() + ' '
print(''.join([O[i]+E[i] for i in range(len(O))]))

Submission status: Accepted

Solution code:
o = input()
e = input()
ans = ''
for i in range(len(e)):
    ans += o[i] + e[i]

if len(o) == len(e)+1:
    ans += o[-1]

print(ans)

Submission status: Accepted

Solution code:
def f07():
    O=input()
    E=input() + ' '
    for o, e in zip(O, E):
        print(o+e, end='')
f07()

Submission status: Accepted

Solution code:
o = input()
e = input()

odd_count = 0
even_count = 0
result = ''

for i in range(1, len(o)+len(e)+1):
    if i % 2 == 0:
        result += e[even_count]
        even_count += 1
    else:
        result += o[odd_count]
        odd_count += 1
print(result)

Submission status: Accepted

Solution code:
O = input()
E = input()

ans = ''

for i in range(len(E)):
    ans += O[i]
    ans += E[i]

if abs(len(O) - len(E)) != 0:
    ans += O[-1]

print(ans)

Submission status: Accepted

Solution code:
from itertools import zip_longest

O = input()
E = input()

if len(O) == len(E):
    print("".join([o + e for o, e in zip_longest(O, E)]))
else:
    print("".join([o + e for o, e in zip_longest(O[:-1], E)]) + O[-1])

Submission status: Accepted

Solution code:
O = input()
E = input()

ans = ""
O = [o for o in O]
E = [e for e in E]

for i in range(len(O) + len(E)):
    if i % 2 == 0:
        ans += O.pop(0)
    else:
        ans += E.pop(0)

print(ans)

Submission status: Accepted

Solution code:
o = input()
e = input()
ans = ""
if len(o) == len(e):
	for i in range(len(o)):
		ans += (o[i]+e[i])
elif len(o) > len(e):
	for i in range(len(e)):
		ans += (o[i]+e[i])
	ans += o[-1]
elif len(e) > len(o):
	for i in range(len(o)):
		ans += (o[i]+e[i])
	ans += e[-1]
print(ans)

Submission status: Accepted

Solution code:
o = input()
e = input()
ans = [0] * (len(o) + len(e))
ans[::2] = o
ans[1::2] = e
print(''.join(ans))

Submission status: Accepted

Solution code:
from collections import deque
O = deque(list(input()))
E = deque(list(input()))
ans = []
while O:
    ans.append(O.popleft())
    if E:
        ans.append(E.popleft())
print("".join(ans))

Submission status: Accepted

Solution code:
o = input()
e = input()

for x, y in zip(o, e):
    print(x + y, end = '')
if len(o) != len(e):
    print(o[-1])
else:
    print()

Submission status: Accepted

Solution code:
o = input()
e = input()

for i in range(min(len(o), len(e))):
    print(o[i], end="")
    print(e[i], end="")

if len(o) > len(e):
    print(o[-1])
elif len(o) < len(e):
    print(e[-1])

Submission status: Accepted

Solution code:
O = input()
E = input()

res = ""
for i in range(len(O) - 1):
    res += O[i] + E[i]

res += O[len(O) - 1]
if len(E) == len(O):
    res += E[len(E) - 1]

print(res)

Submission status: Accepted

Solution code:
O = input()
E = input()
ans = ""
for i in range(len(O+E)):
    if i%2 == 0:
        ans+=O[i//2]
    elif i%2 == 1:
        ans+=E[(i-1)//2]
print(ans)

Submission status: Accepted

Solution code:
o = input()
e = input()
ans = ''
for i in range(len(e)):
    ans+=o[i]+e[i]
if len(o)>len(e):
    ans+=o[-1]
print(ans)

Submission status: Accepted

Solution code:
O = input()
E = input()

ans = ""
for i in range(len(O)+len(E)):
    if i%2 == 0:
        ans += O[i//2]
    else:
        ans += E[i//2]

print(ans)

Submission status: Accepted

Solution code:
O = input()
E = input()

if len(O)>len(E):
  E += " "
  
ans = [O[i]+E[i] for i in range(len(O))]

print(*ans,sep="")

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
O = input()
E = input()
pw = ''
for i in range(len(O)):
    pw += O[i] + (E[i] if E[i:i+1] else '')
print(pw)

Submission status: Accepted

Solution code:
O = input()
E = input()

res = [None for _ in range(len(O) + len(E))]

for i in range(len(res)):
    if i % 2 == 0:
        res[i] = O[i//2]
    else:
        res[i] = E[i//2]

print(''.join(res))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1

def main():
    O=input()
    E=input()+' '
    for a,b in zip(O,E):
        print(a+b,sep='',end='')
    print('')

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
o = input()
o_len = len(o)
e = input()
e_len = len(e)
ans = ""
flag1 = "on"
flag2 = "on"
for i in range(1,101):
    if o_len >= i:
        ans = ans + o[i-1]
    else:
        flag1 = "off"
    if e_len >= i:
        ans = ans + e[i-1]
    else:
        flag2 = "off"

    if flag1 == "off" and flag2 == "off":
        break
print(ans)

Submission status: Accepted

Solution code:
O = input()
E = input()
password = ''
for o, e in zip(O, E):
  password += o + e

if len(O) > len(E):
  password += O[-1]

print(password)

Submission status: Accepted

Solution code:
def func(o, e):
  pwd = ""
  if len(o) == len(e):
    for i in range(len(o)):
      pwd += o[i] + e[i]
  else:
    for i in range(len(e)):
      pwd += o[i] + e[i]
    pwd += o[len(o)-1]
  print(pwd)

o = input()
e = input()

func(o, e)

Submission status: Accepted

Solution code:
o=input()
e=input()
ans=''
for i in range(len(o)):
    ans+=o[i]
    if i<len(e):
        ans+=e[i]
print(ans)

Submission status: Accepted

Solution code:
O = list(input())
E = list(input())
S = ""
for i in range(len(O)):
    S += O[i]
    if i < len(E):
        S += E[i]
print(S)

Submission status: Accepted

Solution code:
a=input()
b=input()
ans=""
for i in range(len(a)):
    if len(b)==i:
        ans+=a[i]
        break
    ans+=a[i]+b[i]
print(ans)

Submission status: Accepted

Solution code:
O=input()
E=input()
s=''
if len(O)==len(E):
    for i in range (len(O)):
        s+=O[i]+E[i]
else:
    for i in range (len(O)-1):
        s+=O[i]+E[i]
    s+=O[-1]
print(s)

Submission status: Accepted

Solution code:
O =input()
E = input()

if len(O)==len(E):
    for a,b in zip(O,E):
        print(a+b, end="")
else:
    for i in range(len(E)):
        print(O[i]+E[i], end="")
    print(O[-1],end="")

Submission status: Accepted

Solution code:
o = input()
e = input()

length = len(o) if len(o) > len(e) else len(e)
ans = ''
for i in range(length):
    try:
        ans += o[i]
        ans += e[i]
    except IndexError:
        pass
print(ans)

Submission status: Accepted

Solution code:
O = input()
E = input()
ans = ''
for i in range(len(O)):
    ans += O[i]
    if i < len(E):
        ans += E[i]
print(ans)

Submission status: Accepted

Solution code:
O=list(str(input()))
E=list(str(input()))

ans=[]
for i in range(len(E)):
  ans.append(O[i])
  ans.append(E[i])
if len(O)>len(E):
  ans.append(O[-1])
print("".join(ans))

Submission status: Accepted

Solution code:
O = input()
E = input()
ans = ''
for i in range(len(O) + len(E)):
    if not i % 2:
        ans = ans + O[i//2]
    else:
        ans = ans + E[i//2]
print(ans)

Submission status: Accepted

Solution code:
O = input()
E = input()
ans = ""
for i in range(min(len(O), len(E))):
    ans += O[i]+E[i]
if len(O) > len(E):
    print(ans+O[-1])
else:
    print(ans)

Submission status: Accepted

Solution code:
o = list(input())
s = list(input()) + ['']
print(*[o + s for o, s in zip(o, s)], sep='')

Submission status: Accepted

Solution code:
o = input()
e = input()
ans = []

for i in range(len(e)):
    ans.append(o[i])
    ans.append(e[i])

if len(o) != len(e):
    ans.append(o[-1])

print("".join(ans))

Submission status: Accepted

Solution code:
o = input()
e = input()
ans = []

for i in range(len(o) - 1):
    ans.append(o[i])
    ans.append(e[i])

ans.append(o[-1])

if len(o) == len(e):
    ans.append(e[-1])

print("".join(ans))

Submission status: Accepted

Solution code:
o = list(input())
e = list(input())
ans = []

for i in range(len(o) - 1):
    ans.append(o[i])
    ans.append(e[i])

ans.append(o[-1])

if len(o) == len(e):
    ans.append(e[-1])

print("".join(ans))

Submission status: Accepted

Solution code:
o = list(input())
e = list(input())

p = []

for i in range(len(o + e)):
    if i % 2 == 0:
        p.append(o.pop(0))
    else:
        p.append(e.pop(0))

print(''.join(map(str, p)))

Submission status: Accepted

Solution code:
O = input()
E = input()

ans = []
cnt = 0

for i in range(len(E)):
    ans.append(O[i])
    ans.append(E[i])

if len(O)>len(E):
    ans.append(O[-1])

print("".join(ans))

Submission status: Accepted

Solution code:
o = list(input())
e = list(input())

for i in range(len(o)):
    print(o[i], end="")
    if i < len(e):
        print(e[i],end="")

Submission status: Accepted

Solution code:
o = input()
e = input()

olen = len(o)
elen = len(e)

res = ""

if olen == elen:
    for i in range(olen):
        res += o[i]
        res += e[i]
    print(res)

else:
    for i in range(elen):
        res += o[i]
        res += e[i]
    res += o[elen]
    print(res)

Submission status: Accepted

Solution code:
def main():
    o = list(input())
    e = list(input())

    ans = ''
    if len(o) == len(e):
        for i in range(len(o)):
            ans += o[i]+e[i]
    else:
        for i in range(len(o)-1):
            ans += o[i]+e[i]
        ans += o[-1]
    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
o = input()
e = input()
if len(e) != len(o):
  e += ' '
password = ''
for i in range(len(o)):
  password += o[i] + e[i]
print(password)

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()

def resolve():
    o=list(input())
    e=list(input())
    ans=''
    for x,y in zip(o,e):
        ans+=x+y
    if len(o)-len(e)==1:
        ans+=o[-1]
    print(ans)
resolve()

Submission status: Accepted

Solution code:
O = input()
E = input()
pw = [None] * (len(O) + len(E))
for i in range(len(O)):
    pw[2 * i] = O[i]
for j in range(len(E)):
    pw[2 * j + 1] = E[j]
print(''.join(pw))

Submission status: Accepted

Solution code:
O = input()
E = input()

for i in range(len(E)):
  print(O[i]+E[i],end='')
if len(O)!=len(E):
  print(O[-1])

Submission status: Accepted

Solution code:
s = input()
t = input()

for i in range(len(s)+len(t)):
  if i%2 == 0:
    print(s[i//2],end='')
  else:
    print(t[i//2],end='')

Submission status: Accepted

Solution code:
o = str(input())
e = str(input())
password = ""

for i in range(min(len(o), len(e))):
    password += o[i] + e[i]
if len(o) != len(e):
    password += o[-1]
print(password)

Submission status: Accepted

Solution code:
o = str(input())
e = str(input())
ans = ""

for i in range(len(o)):
    ans += (o + e)[i::len(o)]
print(ans)

Submission status: Accepted

Solution code:
o = input()
e = input()
print(*[a+b for a,b in zip(o,e)], sep='', end='')
if len(o) != len(e):
    print(o[len(o) - 1])

Submission status: Accepted

Solution code:
o = input()
e = input()
ans = []
for i in range(len(e)):
    ans.append(o[i])
    ans.append(e[i])
if len(o) == len(e):
    print(''.join(ans))
else:
    ans.append(o[-1])
    print(''.join(ans))

Submission status: Accepted

Solution code:
O=list(input())
E=list(input())
ans=""
if len(O)-len(E) > 0:
    ans+=O[0]
    O.pop(0)
    for i in range(len(O)):
        ans+=E[i]
        ans+=O[i]
else:
    for i in range(len(O)):
        ans+=O[i]
        ans+=E[i]
print(ans)

Submission status: Accepted

Solution code:
def main():
    O = input()
    E = input()

    ans = ''
    for i in range(len(O)):
        if len(O) == len(E):
            ans += O[i] + E[i]
        elif i < len(O)-1:
            ans += O[i] + E[i]
        else:
            ans += O[i]

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
O = list(input())
E = list(input())
L = ''
for i in range(len(O+E)):
    if i%2 == 0:
        s = O.pop(0)
        L += s
    else:
        s = E.pop(0)
        L += s
print(L)

Submission status: Accepted

Solution code:
O = list(input())
E = list(input())

ans = []

for i in range(len(E)):
    ans.append(O[i])
    ans.append(E[i])

if len(O) > len(E):
    ans.append(O[-1])
print(''.join(ans))

Submission status: Accepted

Solution code:
print("".join(map(lambda t: "".join(t), zip(input(), input() + " "))).strip())

Submission status: Accepted

Solution code:
o = input()
e = input()
ans = ''
n = len(o)
a = 0
while a < n:
  ans += o[a]
  if a+1 <= len(e):
    ans += e[a]
  a += 1
print(ans)

Submission status: Accepted

Solution code:
o=str(input())
e=str(input())
s="A"
l=min(len(o),len(e))
for i in range(0,l):
  s=s+o[i]+e[i]
if len(o)<len(e):
  s=s+e[len(e)-1]
elif len(o)>len(e):
  s=s+o[len(o)-1]
s=s.lstrip("A")
print(s)