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()

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

print(ans)

Submission status: Accepted

Solution code:
O = input()
E = list(input())+['']

for i in range(len(O)):
    print(O[i],end='')
    print(E[i],end='')
print()

Submission status: Accepted

Solution code:
O = list(str(input()))
E = list(str(input()))
lists = []
if (len(O) - len(E)) == 0:
    for i in range(len(O)):
        lists.append(O[i])
        lists.append(E[i])
else:
    E.append(";")
    for i in range(len(O)):
        lists.append(O[i])
        lists.append(E[i])
    del lists[-1]
print("".join(lists))

Submission status: Accepted

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

Submission status: Accepted

Solution code:

def read_input():
    o = input().strip()
    e = input().strip()

    return o, e

def submit():
    o, e = read_input()

    result = []

    for oc, ec in zip(o, e):
        result.append(oc)
        result.append(ec)

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

    print(''.join(result))

if __name__ == '__main__':
    submit()

Submission status: Accepted

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

S = []
for o, e in zip(O, E):
    S += [o, e]

len(O)
len(E)

if len(O) == len(E):
    print(''.join(S))
else:
    print(''.join(S+[O[-1]]))

Submission status: Accepted

Solution code:
print(''.join(map(''.join,zip(input(),input()+' '))))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = list(input())
b = list(input()) + [""]
print(''.join([x+y for x , y in zip(a,b)]))

Submission status: Accepted

Solution code:
s = input()
t = input()
x = ''
if len(s) == len(t):
  for i in range(len(s)):
    x += s[i]
    x += t[i]
elif len(s) > len(t):
  for i in range(len(t)):
    x += s[i]
    x += t[i]
  x += s[-1]
else:
  for i in range(len(s)):
    x += s[i]
    x += t[i]
  x += t[-1]
print(x)

Submission status: Accepted

Solution code:
O, E = input(), 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()
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:
# vim: set fileencoding=utf-8:


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

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

    if len(O) > len(E):
        ans += O[-1]
    elif len(O) < len(E):
        ans += E[-1]
    elif len(O) == len(E):
        pass

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

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

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):
    ans += O[-1]

print(ans)

Submission status: Accepted

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

no = len(O)
ne = len(E)

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

if no > ne:
    ans += O[-1]

print(ans)

Submission status: Accepted

Solution code:
from itertools import zip_longest

o = input()
e = input()
for x,y in zip_longest(o, e, fillvalue=""):
    print(x+y, end="")
print("")

Submission status: Accepted

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

if len(O)-len(E)==0:
    for i in range(len(O)):
        a.append(O[i])
        a.append(E[i])
else:
    for i in range(len(O)-1):
        a.append(O[i])
        a.append(E[i])
    a.append(O[len(O)-1])
b=''
for x in a:
    b += x

print(b)

Submission status: Accepted

Solution code:
from functools import reduce
from itertools import zip_longest
from operator import add

print(reduce(add, [o + (e or "") for o,e in zip_longest(input(),input())]))

Submission status: Accepted

Solution code:
o = list(input())
e = list(input())
 
oe = list()
 
while len(o) > 0 or len(e) > 0:
    if len(o) > len(e):
        oe.append(o.pop())
    else:
        oe.append(e.pop())
 
oe.reverse()
print(''.join(oe))

Submission status: Accepted

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

oe = list()

while len(o) > 0 or len(e) > 0:
    if len(o) > len(e):
        oe.append(o.pop())
    else:
        oe.append(e.pop())

oe.reverse()
print(''.join(oe))

Submission status: Accepted

Solution code:
a,s=input(),input()
if len(a)==len(s):
    ans=[a[i]+s[i] for i in range(len(a))]
else:
    ans=[a[0]]+[s[i]+a[i+1] for i in range(len(s))]
print("".join(ans))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, os

f = lambda:list(map(int,input().split()))
if 'local' in os.environ :
    sys.stdin = open('./input.txt', 'r')

def solve():
    o = input()
    e = input()

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

solve()

Submission status: Accepted

Solution code:
A=input()
B=input()
print("".join(B[i//2]if i%2 else A[i//2]for i,_ in enumerate(A+B)))

Submission status: Accepted

Solution code:
a = input()
b = input()
c = list(a) +list(b)
d = []
for i in range(len(c)):
    if i%2 == 0:
        d.append(c[int(i/2)])
    else:
        d.append(c[int(i/2)+len(a)])
print(''.join(d))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
o = input()
e = input()
ans = [""]*100
for i in range(len(o)):
    ans[2*i]+=o[i]
for j in range(len(e)):
    ans[2*j+1]+=e[j]
print("".join(ans))

Submission status: Accepted

Solution code:
o=list(input()) + [""]
e=list(input()) + [""]
for i,j in zip(o,e):
	print(i+j, end="")

Submission status: Accepted

Solution code:
# -*- coding utf-8 -*-
a=input()
b=input()
ans=""

for i in range(len(a)):
    ans+=a[i:i+1]
    ans+=b[i:i+1]

print(ans)

Submission status: Accepted

Solution code:
O=input()
E=input()
ANS=["" for i in range(100)]

for i in range(len(O)):
    ANS[i*2]=O[i]

for i in range(len(E)):
    ANS[i*2+1]=E[i]


print("".join(ANS))

Submission status: Accepted

Solution code:
p1=input()
p2=input()
ans=""
if len(p1)==len(p2):
    for i in range(len(p1)):
        ans+=p1[i]
        ans+=p2[i]
else:
    for i in range(len(p1)-1):
        ans+=p1[i]
        ans+=p2[i]
    ans+=p1[-1]
print(ans)

Submission status: Accepted

Solution code:
o = input().rstrip()
e = input().rstrip()
s = ""
for i in range(len(e)):
    s += o[i] + e[i]
if len(o) != len(e):
    s += o[-1]
print(s)

Submission status: Accepted

Solution code:
odd = list(input())
even = list(input())+ [""]

for x, y in zip(odd, even):
  print(x+y, end="")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from itertools import zip_longest
O = input()
E = input()
print("".join([(o or "") + (e or "") for o, e in zip_longest(O, E)]))

Submission status: Accepted

Solution code:
o = list(input())
e = list(input()) + [""]
for x,y in zip(o,e):print(x+y,end="")

Submission status: Accepted

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

ans = []
for i in range(len(o)):
  ans.append(o[i])
  if i < len(o)-1:
    ans.append(e[i])
  else:
    if len(e) == len(o):
      ans.append(e[i])
    
print("".join(ans))

Submission status: Accepted

Solution code:
o = list(input())
e = list(input())+[""]
for x,y in zip(o,e):
  print(x+y,end="")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from functools import reduce
import math

def main():
    # N! を求める
    # f = math.factorial(N)
    
    # 切り捨て
    # 4 // 3
    # 切り上げ
    #-(-4 // 3)
    
    # 初期値用:十分大きい数(100億)
    # 1e10

    # 初期値用:十分小さい数(-100億)
    # -1e10
    
    # 1文字のみを読み込み
    # 入力:2
    # a = input().rstrip()
    # 変数:a='2'
    
    # スペース区切りで標準入力を配列として読み込み
    # 入力:2 4 5 7
    # a, b, c, d = (int(_) for _ in input().split())  
    # 変数:a=2 b=4 c=5 d =7
    
    # 1文字ずつ標準入力を配列として読み込み
    # 入力:2 4 5 7
    # a = list(int(_) for _ in input().split())
    # 変数:a = [2, 4, 5, 7]    

    # 1文字ずつ標準入力を配列として読み込み
    # 入力:2457
    # a = list(int(_) for _ in input())
    # 変数:a = [2, 4, 5, 7]    
    O = list(_ for _ in input())
    E = list(_ for _ in 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))
    
if __name__ == '__main__':
    main()

Submission status: Accepted

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

    print(ans) 
else:
    for i in range(len(E)):
        ans+=O[i]
        ans+=E[i]
        
    ans+=O[len(O)-1]
    print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

res = ""
o_cnt = 0
e_cnt = 0
while True:
    if o_cnt == len(O) and e_cnt == len(E):
        break
    if o_cnt < len(O):
        res += O[o_cnt]
        o_cnt += 1

    if e_cnt < len(E):
        res += E[e_cnt]
        e_cnt += 1

print(res)

Submission status: Accepted

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

for x,y in zip(o,e):
    print(x+y,end="")

Submission status: Accepted

Solution code:
import sys

def main():
    input = sys.stdin.readline
    O = str(input().strip())
    E = str(input().strip())

    ans = ''
    for i in range(len(O)):
        if i == len(O) - 1 and len(O) != len(E):
            ans += O[i]

        else:
            ans += O[i]
            ans += E[i]

    return ans


if __name__ == '__main__':
    print(main())

Submission status: Accepted

Solution code:
O=input()
E=input()
s=''
if len(O)-len(E)==1:
    for o,e in zip(O[:-1],E):
        s+=o+e
    s+=O[-1]
else:
    for o,e in zip(O,E):
        s+=o+e
print(s)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

ni = lambda: int(sys.stdin.readline().rstrip())
nm = lambda: map(int, sys.stdin.readline().split())
nl = lambda: list(nm())
ns = lambda: sys.stdin.readline().rstrip()

o = list(ns())
e = list(ns())
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 = str(raw_input())
e = str(raw_input())
s = ''
for i in range(len(e)):
	s = s + o[i] + e[i]
if len(o) > len(e):
	s += o[-1]
print s

Submission status: Accepted

Solution code:
s = input()
t = input()
ans = ""
for i in range(min(len(s),len(t))):
    ans += s[i]
    ans += t[i]
if len(s) != min(len(s),len(t)):
    ans += s[-1]
elif len(t) != min(len(s),len(t)):
    ans += t[-1]

print(ans)

Submission status: Accepted

Solution code:
j=''.join;print(j(map(j,zip(*open(0)))))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
list_o=list(input())
list_e=list(input())+[""]

for a,b in zip(list_o,list_e):print(a + b,end="")

Submission status: Accepted

Solution code:
O, E = [input() for _ in range(2)]
rest_str = ''

for i in range(len(O)):
    try:
        rest_str += O[i]+E[i]
    except IndexError:
        rest_str += O[i]

print(rest_str)

Submission status: Accepted

Solution code:
"""
変数Oは奇数、Eは偶数番目の文字列
各変数を結合して、、元の文字列を復元する。
"""


O, E = [input() for _ in range(2)]

rest_str = ''
for i in range(len(O)):
    try:
        rest_str += O[i]+E[i]
    except IndexError:
        rest_str += O[i]

print(rest_str)

Submission status: Accepted

Solution code:
a = list(input())
b = list(input())

c = []

aa = len(a)
bb = len(b)

if aa == bb:
    for i in range(aa):
        x = a[i] 
        y = b[i]
        c.append(x)
        c.append(y)
else:
    m = a.pop(-1)
    for i in range(aa -1):
        x = a[i] 
        y = b[i]
        c.append(x)
        c.append(y)
    c.append(m)
        
print(''.join(c))

Submission status: Accepted

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

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

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

print(ans)

Submission status: Accepted

Solution code:
O = list(input())
E = list(input()) + [""]

for x, y in zip(O, E):
    print(x + y, end="")

Submission status: Accepted

Solution code:
a = input()
b = input()

c = ""

for i in range(len(b)):
  c = c + a[i] + b[i]

if len(a) > len(b):
  c = c + a[-1]

print(c)

Submission status: Accepted

Solution code:
O, E = list(input()), list(input())
p = []
for i, o in enumerate(O):
	p.append(o)
	if i < len(E):
		p.append(E[i])
print("".join(p))

Submission status: Accepted

Solution code:
a=list(input())
b=list(input())
flag_a=0
flag_b=0
for i in range(len(a)+len(b)):
  
  if(flag_a==flag_b):
    print(a[flag_a],end="")
    flag_a+=1
  else:
    print(b[flag_b],end="")
    flag_b+=1
print("")

Submission status: Accepted

Solution code:
print(''.join(sum(map(list,zip(input(),input()+' ')),[])))

Submission status: Accepted

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

o = list(input())
e = list(input())

password = []

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

print("".join(password))

Submission status: Accepted

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

Submission status: Accepted

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

for i in range(len(e)):
    print(o[i], e[i], sep="",end="")
if len(o) != len(e):
    print(o[-1])
else :
    print()

Submission status: Accepted

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

s = ''

O = input()
E = input()
for o, e in zip(O, E):
    s += o+e
print(s if len(O) == len(E) else s + O[-1])

Submission status: Accepted

Solution code:
o=input()
e=input()
ans=""
for i in range(len(o)+len(e)):
  ans+=o[i//2] if i%2<1 else e[i//2]
print(ans)

Submission status: Accepted

Solution code:
def password(O: str, E: str)->str:
    ret = ''
    for i in range(len(E)*2):
        if i % 2:
            ret += E[i//2]
        else:
            ret += O[i//2]
    return ret + (O[-1] if len(E) < len(O) else '')


if __name__ == "__main__":
    O = input()
    E = input()
    ans = password(O, E)
    print(ans)

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = I()
    return l
def LIR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LI()
    return l
def SR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = S()
    return l
def LSR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = SR()
    return l
mod = 1000000007

#A
"""
a,b,c = LI()
if b-a == c-b:
    print("YES")
else:
    print("NO")
"""
#B
o = S()
e = S()
for i in range(len(e)):
    o.insert(2*i+1,e[i])
for i in o:
    print(i,end = "")
print()
#C
"""
n = I()
s = SR(n)
for i in range(n):
    for j in range(len(s[i])):
        while s[i][j] in s[i][:j]:
            s[i][j] = "0"+s[i][j]
ans = set(s[0])
for i in range(1,n):
    ans &= set(s[i])
ans = sorted(list(ans))
if len(ans) == 0:print()
else:
    for i in range(len(ans)):
        ans[i] = ans[i][-1]
    ans.sort()
    for i in range(len(ans)-1):
        print(ans[i],end = "")
    print(ans[-1])
"""

#D
"""
n,m = LI()
ln = [n-1]
lm = [m-1]
a = n-1
b = m-1
while a > 2:
    a -= 2
    ln.append(ln[-1]+a)
while b > 2:
    b -= 2
    lm.append(lm[-1]+b)
la = len(ln)
lb = len(lm)
for i in range(la):
    if i or a == 2:
        ln.append(ln[la-i-1])
for i in range(lb):
    if i or b == 2:
        lm.append(lm[lb-i-1])
x,y = LIR(2)
lx = 0
ly = 0
for i in range(n-1):
    lx += ln[i]*(x[i+1]-x[i])%mod
    lx %= mod
for i in range(m-1):
    ly += lm[i]*(y[i+1]-y[i])%mod
    ly %= mod
ans = lx*ly%mod
print(ans)
"""
#E

#F

#G

#H

#I

#J

#K

#L

#M

#N

#O

#P

#Q

#R

#S

#T

Submission status: Accepted

Solution code:
O = input()
E = input()
while True:
    if len(O)!=0:
        print(O[0],end='')
        O = O[1:]
    if len(E)!=0:
        print(E[0],end='')
        E = E[1:]
    if len(O)==0 and len(E)==0:
        print()
        break

Submission status: Accepted

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


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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input()
b = input()
c = ""
for i in range(len(b)):
  c = c + a[i] + b[i]
if len(a)>len(b):
  c = c + a[len(a)-1]
print(c)

Submission status: Accepted

Solution code:
a = input()
b = input()

for i in range(len(b)):
    print(a[i], sep="", end="")
    print(b[i], sep="", end="")

if len(a) > len(b):
    print(a[len(a)-1])

Submission status: Accepted

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

for i in range(len(O)):
  ans += O[i]
  if i+1 <= len(E):
    ans += E[i]
  
print(ans)

Submission status: Accepted

Solution code:
[O,E]=[list(input()) for i in range(2)]
pas=["z" for i in range(len(O)+len(E))]
for i in range(len(pas)):
    if i%2==0:#奇数番目
        pas[i]=O[i//2]
    else:
        pas[i]=E[i//2]
print("".join(pas))

Submission status: Accepted

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

ans = ""
if len(O) == len(E):
    for i in range(len(E)):
        ans += O[i]
        ans += E[i]
else:
    for i in range(len(E)):
        ans += O[i]
        ans += E[i]
    ans += O[len(O)-1]
print(ans)

Submission status: Accepted

Solution code:
l1 = list(input())
l2 = list(input())
ans = []
for i in range(len(l1)):
    try:
        ans.append(l1[i])
        ans.append(l2[i])
    except:
        a = 0
print("".join(ans))

Submission status: Accepted

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

result = ''
for i in range(len(O)):
    result += O[i]
    try:
        result += E[i]
    except IndexError:
        break
print(result)

Submission status: Accepted

Solution code:
O = input()
E = input()
s = ''
for o, e in zip(O, E):
    s += o+e
print(s if len(O) == len(E) else s + O[-1])

Submission status: Accepted

Solution code:
#058 B
O =str(input())
E =str(input())
ans=""
for i,o in enumerate(O):
    ans+=o
    try:
        ans+=E[i]
    except:
        pass
print(ans)

Submission status: Accepted

Solution code:
O = input()
E = input()
s = ''
for o, e in zip(O, E):
    s += o + e
print(s if len(O) == len(E) else s + O[-1])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

for i in range(max(len(O), len(E))):
    if len(O) > 0:
        ans += O.pop(0)
    if len(E) > 0:
        ans += E.pop(0)
print(ans)

Submission status: Accepted

Solution code:
a,b,s=input(),input(),""
for i in range(len(a)-1):s+=a[i]+b[i]
if len(a)!=len(b):s+=a[-1]
else:s+=a[-1]+b[-1]
print(s)

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 = input()
E = input()

ans = ""
for i in range(len(O)):
    ans += O[i]
    if i<=len(E)-1:
        ans += E[i]
print(ans)

Submission status: Accepted

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

res = ""
for i in range(len(o)):
    res += o[i]
    if i < len(e):
        res += e[i]

print(res)

Submission status: Accepted

Solution code:
a = list(input())
b = list(input())

c = []
cnt = 0
while cnt < len(a):
    c.append(a[cnt])
    if cnt < len(b):
        c.append(b[cnt])
    cnt += 1

print(''.join(c))

Submission status: Accepted

Solution code:
odd = input()
even = input()

ans = ''

n = len(odd) + len(even)

for i in range(n):
    ans += odd[i]
    
    if len(ans) == n:
        break
    
    ans += even[i]
    
    if len(ans) == n:
        break
    
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
lo=list(input())
le=list(input())
l=""
for i in range(len(le)):
  l+=lo[i]
  l+=le[i]
if len(le)==len(lo):
  print(l)
else:
  print(l+lo[-1])

Submission status: Accepted

Solution code:
O = [i for i in input()]
E = [i for i in input()]
ans=[]
for (o,e) in zip(O,E):
    ans.append(o)
    ans.append(e)
if len(O)==len(E):
    print("".join(ans))
else:
    if len(O)>len(E):
        print("".join(ans)+O[-1])
    else:
        print("".join(ans)+E[-1])

Submission status: Accepted

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

ans = ''

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
o=input()
e=input()
j,k,res=0,0,""
for i in range(len(o)+len(e)):
  if i %2:
    res+=e[k]
    k+=1
  else:
    res+=o[j]
    j+=1
print(res)

Submission status: Accepted

Solution code:
def main():
    O = input()
    E = input()
    ans = ""
    for i in range(len(O)):
        ans += O[i]
        try:
            ans += E[i]
        except IndexError:
            pass
    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
O = input()
E = input()
s = ''
for a in zip(O,E):s += a[0]+a[1]
if len(O) != len(E):s += O[-1]
print(s)

Submission status: Accepted

Solution code:
from itertools import zip_longest
O=list(input())
E=list(input())
ans=''
for o,e in zip_longest(O,E):
  if bool(o): ans += o
  if bool(e): ans += e
print(ans)

Submission status: Accepted

Solution code:
a = input()
b = input()
if len(a) == len(b):
  print("".join([x+y for (x,y) in zip(a, b)]))
else:
  print("".join([x+y for (x,y) in zip(a, b)]) + a[-1])

Submission status: Accepted

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

Submission status: Accepted

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

print("".join(i+j for i, j in zip(o, e)) if len(o) ==len(e) else "".join(i+j for i, j in zip(o,e))+o[-1])

Submission status: Accepted

Solution code:
o = raw_input()
e = raw_input()
s = ""
l = len(o)
if len(e)>l:
	l = len(e)
for i in range(l):
	if i<len(o):
		s = s+o[i]
	if i<len(e):
		s = s+e[i]
print s

Submission status: Accepted

Solution code:
print((lambda a, b: ''.join([k for i in zip(a, b) for j in i for k in j]) + (a[-1] if len(a) != len(b) else ''))(input(), input()))

Submission status: Accepted

Solution code:
O = input()
E = input()
length =  len(O) + len(E)
strings = ""
for i in range(length//2):
    strings += O[i]
    strings += E[i]
if len(O) > len(E):
    strings += O[-1]
print(strings)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

Solution code:
O = str(input())
E = str(input())
tmp = 0
pas = ""
for i in range(0,len(O)+len(E),1):
  if i%2 == 0:
    pas += O[tmp]
  else:
    pas += E[tmp]
  if i%2 == 1:
    tmp += 1
print(pas)

Submission status: Accepted

Solution code:
import itertools
o = input()
e = input()
res = ''
for os,es in itertools.zip_longest(o,e):
    if os is not None:
        res += os
    if es is not None:
        res += es
print(res)

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):
    print(ans)
else:
    ans += O[-1]
    print(ans)

Submission status: Accepted

Solution code:
O=list(input())
E=list(input())
ans = O.copy()
for i in range(len(E)):
    ans.insert(2*i+1, E[i])
print(''.join(ans))

Submission status: Accepted

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

ans = ""
i = 0
while 1:
    if len(o) > i:
        ans = ans + o[i]
    else:
        break
    if len(e) > i:
        ans = ans + e[i]
    else:
        break
    i += 1

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]
        ans += e[i]
else:
    for i in range(len(e)):
        ans += o[i]
        ans += e[i]
    ans += o[-1]
print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
s=input()
t=input()
ans=""
for i in range(len(s)+len(t)):
    if i%2==0:ans+=s[i//2]
    else:ans+=t[i//2]
print(ans)

Submission status: Accepted

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

pw = ''
for i in zip(O, E):
    pw += i[0] + i[1]

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

print(pw)

Submission status: Accepted

Solution code:
o=[i for i in input()]
e=[i for i in input()]
text=""
for i in zip(o,e):
    text+=i[0]+i[1]
if len(o)>len(e):
    text+=o[-1]
print(text)

Submission status: Accepted

Solution code:
""" AtCoder """

O = input()
E = input()

ans = ''
o_len = len(O)
e_len = len(E)
tmp_len = min(o_len, e_len)

for i in range(tmp_len):
    ans += O[i]
    ans += E[i]
if abs(o_len - e_len) == 1:
    ans += O[-1]

print(ans)

Submission status: Accepted

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

if(len(O) == len(E)):
  for i in range(len(O)):
    str += O[i]
    str += E[i]
  print(str)
else:
  for i in range(len(O)):
   if(i != len(O)-1):
    str += O[i]
    str += E[i]
   else:
    str += O[i]
  print(str)

Submission status: Accepted

Solution code:
j=''.join;print(j(map(j,zip(input(),input()+' '))))

Submission status: Accepted

Solution code:
#!/usr/bin/python3
# ABC058_B
"""
∵∴∵
"""

test = False

def restore():
    """
    奇数番目の文字の文字列 O
    偶数番目の文字の文字列 E
    からもとの文字列を復元する関数
    """
    O = input()  # 奇数番目の文字
    E = input()  # 偶数番目の文字
    password = ''  # もとのパスワード
    len_O = len(O)
    if test:
        print(len_O)

    for i in range(len_O):
        password += O[i]
        try:
            password += E[i]
        except IndexError:
            pass

    return password


def main():
    """
    main関数
    """
    print(restore())


if __name__ == '__main__':
    main()