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

n = len(o) + len(e)
s = ['' for _ in range(n)]
for i in range(n):
    j = i // 2
    if i % 2 == 0:
        s[i] = o[j]
    else:
        s[i] = e[j]

print(''.join(s))

Submission status: Accepted

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

ans = ""
judge = False
if len(o)-len(e) == 1:
    judge = True

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

print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
O = list(input())
lo = len(O)
E = list(input())
le = len(E)
w = lo + le

X = ['*']*w
for i in range(le):
  X[2*i] =O[i]
  X[2*i+1] = E[i]
if lo > le:
  X[-1] = O[-1]
  
print(''.join(X))

Submission status: Accepted

Solution code:
o = str(input())
e = str(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()

combi=''

for i in range(len(O)+len(E)):
    if i%2==0:
        combi+=O[i//2]
    elif i%2!=2:
        combi+=E[i//2]
print(combi)

Submission status: Accepted

Solution code:
def actual(O, E):
    s = ''.join([f'{o}{e}' for o, e in zip(O, E)])

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

    return s

O = input()
E = input()

print(actual(O, E))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
O=list(input())
E=list(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())

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

Submission status: Accepted

Solution code:
odd = list(map(str, input()))
even = list(map(str, input()))
if len(odd)==len(even):
  L=len(odd)*2
else:
  L=len(odd)+len(even)
li=[]

for i in range(1,L+1):
  if i%2==1:
    if i==1:
      li.append(odd[0])
    else:
      li.append(odd[i//2])
  else:
    li.append(even[i//2-1])
    
print(''.join(li))

Submission status: Accepted

Solution code:
A = input()
B = input()

pw = ""
if len(A) == len(B):
    for i in range(len(A)):
        pw += A[i]
        pw += B[i]
    print(pw)
    exit()

else:
    for i in range(len(B)):
        pw += A[i]
        pw += B[i]
    print(pw + A[-1])
    exit()

Submission status: Accepted

Solution code:
a,b=input(),input()+' ';print(*[i+j for i,j in zip(a,b)],sep='')

Submission status: Accepted

Solution code:
a,b=input(),input();n=[i+j for i,j in zip(a,b)]
print(*[n,n+[a[-1]]][len(a)-len(b)],sep='')

Submission status: Accepted

Solution code:
a,b=input(),input();n=[i+j for i,j in zip(a,b)]
print(*[n,n+[a[-1]]][len(a)-len(b)==1],sep='')

Submission status: Accepted

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

Submission status: Accepted

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

if len(O) - len(E) == 0:
  for i in range(len(O)):
  	Ans.append(O[i])
  	Ans.append(E[i])
else:
  for i in range(len(E)):
    Ans.append(O[i])
    Ans.append(E[i])
  Ans.append(O[len(O)-1])
  
print(''.join(Ans))

Submission status: Accepted

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

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

print(a)

Submission status: Accepted

Solution code:
o = list(input())
e = list(input())
result = []
for a, b in zip(o, e):
    result.append(a)
    result.append(b)
if len(o) > len(e):
    result.append(o[-1])
elif len(e) > len(o):
    result.append(e[-1])
print("".join(result))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
o = input()
e = input()
l =len(o)+len(e)
p = []
for i in range(l):
    if i % 2 == 0:
        p.append(o[i//2])
    else:
        p.append(e[i//2])
        
print(''.join(p))

Submission status: Accepted

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

Submission status: Accepted

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

for so,se in zip(O,E):
    s += so+se

if len(list(O)) > len(list(E)):
    s += O[-1]
elif len(list(O)) < len(list(E)):
    s += E[-1]
    
print(*s,sep="")

Submission status: Accepted

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

n=''
for i in range(len(a)+len(b)):
    if i%2==0:
        n=n+a[i//2]
    else:
        n=n+b[math.ceil(i/2)-1]
print(n)

Submission status: Accepted

Solution code:
o = str(input())
s = str(input())
n = ""

if not len(o) == len(s):
	for i in range(min(len(o),len(s))):
		n += o[i]
		n += s[i]

	if len(o) > len(s):
		n += o[len(o)-1]

else:
	for i in range(len(o)):
		n += o[i]
		n += s[i]
		
print(n)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

passw = [""]
for i in range(len(e)):
    passw.append(o[i])
    passw.append(e[i])
    
if len(o)>len(e):
    passw.append(o[-1])
    
print(''.join(passw))

Submission status: Accepted

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

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:
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
input = sys.stdin.readline
mod = 10**9+7
Max = sys.maxsize
def l(): #intのlist
    return list(map(int,input().split()))
def m(): #複数文字
    return map(int,input().split())
def onem(): #Nとかの取得
    return int(input())
def s(x): #圧縮
    a = []
    if len(x) == 0:
        return []
    aa = x[0]
    su = 1
    for i in range(len(x)-1):
        if aa != x[i+1]:
            a.append([aa,su])
            aa = x[i+1]
            su = 1
        else:
            su += 1
    a.append([aa,su])
    return a
def jo(x): #listをスペースごとに分ける
    return " ".join(map(str,x))
def max2(x): #他のときもどうように作成可能
    return max(map(max,x))
def In(x,a): #aがリスト(sorted)
    k = bs.bisect_left(a,x)
    if k != len(a) and a[k] ==  x:
        return True
    else:
        return False

def pow_k(x, n):
    ans = 1
    while n:
        if n % 2:
            ans *= x
        x *= x
        n >>= 1
    return ans

"""
def nibu(x,n,r):
    ll = 0
    rr = r
    while True:
        mid = (ll+rr)//2

    if rr == mid:
        return ll
    if (ここに評価入れる):
        rr = mid
    else:
        ll = mid+1
"""

O = input()[:-1]
E = input()[:-1]

data = ""

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
O=str(input())
E=str(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:
a = list(input())
b = list(input())+[""]
for x,y in zip(a,b):
  print(x+y, end = "")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
O = input()
E = input()

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

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

print(ans)

Submission status: Accepted

Solution code:
o=input()
e=input()
print("".join([o[i]+e[i] for i in range(len(o)-1)]),end="")
print(o[-1],end="")
if len(o) == len(e):
  print(e[-1])

Submission status: Accepted

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

ans = ""
for i in range(len(O)+len(E)):
    if i % 2:
        ans += E[i//2]
    else:
        ans += O[i//2]
        
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()
flag = True
if len(o) != len(e):
    flag = False
for i in range(len(o)):
    print(o[i], end='')
    if not flag and i == len(e):
        break
    print(e[i], end='')

Submission status: Accepted

Solution code:
o = input()
e = input()
n = []
e += ' '
for i in range(len(o)):
  n.append(o[i])
  n.append(e[i])
print(''.join(n).strip())

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]
    
      
if len(O)>len(E):
  for i in range(len(E)):
    ans+=O[i]+E[i]
  ans+=O[len(O)-1]
  
print(ans)

Submission status: Accepted

Solution code:
#B - ∵∴∵ 
O = list(input())
E = list(input())

S = [O[i//2] if i%2 == 0 else E[i//2] for i in range(len(O)+len(E))]
    
print(''.join(S))

Submission status: Accepted

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

Submission status: Accepted

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

ans = str()

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

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)==1:
    a+=o[-1]
print(a)

Submission status: Accepted

Solution code:
import sys
o = input ()
e = input ()
for i in range (len(e)):
  sys.stdout.write(o[i])
  sys.stdout.flush()
  sys.stdout.write(e[i])
  sys.stdout.flush()
if len(o) > len(e):
  sys.stdout.write(o[-1])
  sys.stdout.flush()

Submission status: Accepted

Solution code:
O = input()
E = input()
A = ""
for x,y in zip(O,E):
  A += x + y
if len(O) == len(E):
  print(A)
else:
  print(A + O[-1])

Submission status: Accepted

Solution code:
# row = [int(x) for x in input().rstrip().split(" ")]
# n = int(input().rstrip())
# s = input().rstrip()

def resolve():
    import sys
    input = sys.stdin.readline

    o = input().rstrip()
    e = input().rstrip()

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

    print(ans)

if __name__ == "__main__":
    resolve()

Submission status: Accepted

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

def main():
    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)
    

if __name__ == "__main__":
    main()

Submission status: Accepted

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

l=""
i=0
j=0
while True:
  if i < len(s):
    l+=s[i]
    i+=1
  if j < len(t):
    l+=t[j]
    j+=1
  if len(l) == len(s)+len(t):
    break
print(l)

Submission status: Accepted

Solution code:
o = input()
e = input()
for i in range(max(len(o), len(e))):
    # print(len(o), len(e), i)
    if len(o) > i:
         print(o[i], end="", sep="")
    if len(e) > i:
         print(e[i], end="", sep="")
print()

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()+' '
print((''.join(['{}{}'.format(a,b) for a,b in zip(o,e)])).replace(' ',''))

Submission status: Accepted

Solution code:
o = str(input())
e = str(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(E)):
    ans += O[i] + E[i]
if len(O) > len(E):
    ans += O[-1]
print(ans)

Submission status: Accepted

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

ans = list()
for i in range(max(len(O),len(E))):
    try:
        ans.extend([O[i],E[i]])
    except IndexError:
        if len(O) > len(E):
            ans.extend(O[i])
        else:
            ans.extend(E[i])
print(''.join(ans))

Submission status: Accepted

Solution code:
import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np
from functools import reduce

rr = lambda: sys.stdin.readline().rstrip()
rs = lambda: sys.stdin.readline().split()
ri = lambda: int(sys.stdin.readline())
rm = lambda: map(int, sys.stdin.readline().split())
rl = lambda: list(map(int, sys.stdin.readline().split()))
inf = float('inf')
mod = 10**9 + 7

o = rr()
e = rr()
s = ''
for a, b in itertools.zip_longest(o, e, fillvalue=''):
  s += a + b
print(s)

Submission status: Accepted

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

for i in range(len(E)):
    O.insert(2 * i + 1, E[i])

print("".join(O))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
O=input()
E=input()
ans=""
for odd, even in zip(O,E):
    ans=ans+odd+even
if len(O)<len(E):
    ans=ans+E[-1]
elif len(O)>len(E):
    ans=ans+O[-1]
print(ans)

Submission status: Accepted

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

res = ""

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
O = input().strip()
E = input().strip()
p = ""
for x in zip(O, E):
    p += x[0]+x[1]
if len(O) != len(E):
    p += O[-1]
print(p)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys


inint = lambda: int(sys.stdin.readline())
inintm = lambda: map(int, sys.stdin.readline().split())
inintl = lambda: list(inintm())
instrm = lambda: map(str, sys.stdin.readline().split())
instrl = lambda: list(instrm())

o = input()
e = input()

ans = ""

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

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

print(ans)

Submission status: Accepted

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

ans =  ""
if len(o) == len(e):
    for c1, c2 in zip(o, e):
        ans += c1 + c2
else:
    for c1, c2 in zip(o[:-1], e):
        ans += c1 + c2
    ans += o[-1]

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

ls=len(s)
lt=len(t)
v=''
for i in range(lt):
    v+=s[i]+t[i]
if lt!=ls:
    v+=s[-1]
print(v)

Submission status: Accepted

Solution code:
import sys
input = lambda: sys.stdin.readline().rstrip()

def main():
    o = input()
    e = input()
    ans = []
    for i in range(max(len(o), len(e))):
        if i < len(o):
            ans.append(o[i])
        if i < len(e):
            ans.append(e[i])
    print(''.join(ans))

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

print(ans)

Submission status: Accepted

Solution code:
#k = int(input())
#s = input()
#a, b = map(int, input().split())
#s, t = map(str, input().split())
#l = list(map(int, input().split()))
#l = [list(map(int,input().split())) for i in range(n)]
#a = [list(input()) for _ in range(n)]

o = input()
n = input()

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

if len(o) - len(n) == 1:
    print(o[-1])

Submission status: Accepted

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

ln=len(e)+len(o)
ans=['' for i in range(ln)]
for i in range(ln):
    if i %2==0:
        ans[i]=e[i//2]
    else:
        ans[i]=o[(i-1)//2]

print("".join(ans))

Submission status: Accepted

Solution code:
N=input()
M=input()
N=list(str(N))
M=list(str(M))
ans=[]
if len(N)>len(M):
  for i in range(len(N)-1):
    ans.append(N[i])
    ans.append(M[i])
  ans.append(N[-1])
else:
  for i in range(len(N)):
    ans.append(N[i])
    ans.append(M[i])
print("".join(ans))

Submission status: Accepted

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

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

print()

Submission status: Accepted

Solution code:
import sys
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
read = sys.stdin.buffer.read
sys.setrecursionlimit(10 ** 7)
INF = float('inf')

O = input()
E = input()

ans = ""
for i in range(len(O)):
    if i < len(E):
        ans += O[i] + E[i]
    else:
        ans += O[i]
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:
O = input()
E = input()
N = len(E)
ans = ''
for i in range(N):
    ans += O[i] + E[i]
if len(O)-len(E) == 1:
    ans += O[-1]
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
o,e=input(),input()
print(''.join(o[i//2]if i%2==0 else e[i//2]for i in range(len(o+e))))

Submission status: Accepted

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

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

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

print(ans)

Submission status: Accepted

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

x = []
for i in range(len(E)):
    x.append(O[i])
    x.append(E[i])
if len(O)!=len(E):
    x.append(O[-1])
s = ''.join(x)
print(s)

Submission status: Accepted

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

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 = ''
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:
from itertools import zip_longest
O = input()
E = input()
print(''.join(S+T for S,T in zip_longest(O,E,fillvalue='')))

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
O=input()
E=input()
L=list()
for i in range(len(O)+len(E)):
  if i%2==0:
    L.append(O[i//2])
  else:
    L.append(E[(i-1)//2])
print("".join(L))

Submission status: Accepted

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

P = ''

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

print(P.rstrip())

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

Solution code:
O=[x for x in input()]
E=[y for y in input()]

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

Submission status: Accepted

Solution code:
o = input()
e = input() + " "
print("".join([a + b for a, b in zip(o, e)]).strip())

Submission status: Accepted

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

l = [0]*(len(O)+len(E))

l[0::2] = list(O)

l[1::2] = list(E)

print("".join(l))

Submission status: Accepted

Solution code:
 
o=input()
e=input()
cnt=0
i , j = 0 , 0
a = len(o)
b = len(e)
ans = ''
while i<a or j<b:
	if cnt%2==0:
 		ans = ans+(o[i])
 		i = i+1
 		cnt = cnt+1
	else:
		ans =ans+(e[j])
		j =j+1
		cnt =cnt+1
while i<a:
	ans = ans+(o[i])
	i = i+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 = ans + (a[i]+b[i])
else:
  for i in range(len(a)-1):
    ans = ans +(a[i]+b[i])
  ans = ans + (a[-1])
print(ans)

Submission status: Accepted

Solution code:
O = input()
E = input()
password = []
for i in range(max(len(O), len(E))):
    if i <= len(O) - 1:
        password.append(O[i])
    if i <= len(E) - 1:
        password.append(E[i])
print(*password, sep='')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
o=input()
s=input()
p=[""]*(len(o)+len(s))
for i in range(len(o)):
  p[i*2]=o[i]
for i in range(len(s)):
  p[i*2+1]=s[i]

print("".join(p))

Submission status: Accepted

Solution code:
o = input()
e = input()
print(*(e[i//2] if i%2 else o[i//2] for i in range(len(o+e))),sep='')

Submission status: Accepted

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

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

if len(o) != len(e):
    print(o[-1])

Submission status: Accepted

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

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

Submission status: Accepted

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

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:
from itertools import zip_longest

o=input()
e=input()

print(''.join([x+y for x,y in zip_longest(o,e,fillvalue='')]))

Submission status: Accepted

Solution code:
from collections import deque
 
O=input()
E=input()
 
o=deque(O)
e=deque(E)
 
s=''
while True:
  if not e  and not o:
    break
  if o:
    s+=o.popleft()
  if e:
    s+=e.popleft()
    
  
print(s)

Submission status: Accepted

Solution code:
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


def main():
    O = readline().strip()
    E = readline().strip()

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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()
S = ""
for o, e in zip(O, E):
  S += o+e
print(S+O[-1] if len(O)-len(E) else S)

Submission status: Accepted

Solution code:
a = input()
b = input()
s = ""
for i in range(len(a)+len(b)):
    s+=a[0]
    a=a[1:]
    a,b=b,a

print(s)

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
o,e = map(list, open(0).read().split())

ans = ''

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

print(ans)

Submission status: Accepted

Solution code:
#その10

O = str(input())
E = str(input())
P = []
for i in range(len(O)):
    P.append(O[i])
    if i < len(E):
        P.append(E[i])
print(''.join(P))

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(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 i%2==0 :
        ans += o[i//2]
    else:
        ans += e[i//2]

print(ans)

Submission status: Accepted

Solution code:
MM = input()
LL = input()
M = list(MM)
L = list(LL)
kara =[]
a = len(M)
b = len(L)
x = a + b
for i in range(x):
  if i%2==0:
    aa = M.pop(0)
    kara.append(aa)
  else:
    bb = L.pop(0)
    kara.append(bb)
for i in kara:
  print(i,end='')

Submission status: Accepted

Solution code:
s1 = input()
s2 = input()
s = [ 'a' for _ in range(len(s1) + len(s2))]

s[::2] = s1
s[1::2] = s2

print(''.join(s))

Submission status: Accepted

Solution code:
o = input()
e = input()
ans = ""
for n1, n2 in zip(o,e) :
    ans += n1
    ans += n2
if len(o) != len(e) :
    ans += o[len(o)-1]
print(ans)

Submission status: Accepted

Solution code:
O = input()
E = input()
ans = ""
for i in range(len(O) + len(E)):
    if i&1:
        ans += E[i//2]
    else:
        ans += O[i//2]
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], end="")
        print(E[i], end="")
elif len(O) > len(E):
    for i in range(len(E)):
        print(O[i], end="")
        print(E[i], end="")
    print(O[i+1])
else:
    for i in range(len(E)):
        print(O[i], end="")
        print(E[i], end="")
    print(E[i+1])

Submission status: Accepted

Solution code:
O = input()
E = 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:
o = input()
e = input()
res = ""
if len(o)>len(e):
  for i in range(len(e)):
    res = res + o[i]
    res = res + e[i]
  res = res + o[len(o)-1]
else:
  for i in range(len(e)):
    res= res + o[i]
    res= res + e[i]
print(res)

Submission status: Accepted

Solution code:
import queue

o = input()
e = input()

odd = list(o)
even = list(e)

answer = []

o_q = queue.Queue()
e_q = queue.Queue()

for i in range(len(odd)):
    o_q.put(odd[i])

for i in range(len(even)):
    e_q.put(even[i])

while not o_q.empty():
    answer.append(o_q.get())
    if e_q.empty():
        continue
    answer.append(e_q.get())

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

Submission status: Accepted

Solution code:
o=input()
e=input()
mix=[o,e]
ans=[]
for i in range(len(o)+len(e)):
    ans.append(mix[i%2][i//2])
print(''.join(ans))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
O = list(input())
E = list(input())+[""]
o = len(O)
x =[]
for i in range(o):
  ans = O[i] + E[i]
  x.append(ans)

print("".join(x))

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

Solution code:
e = list(input())
t = list(input())
password = ""
count_e = 0
count_t = 0
for i in range(len(e) + len(t)):
    if i % 2 == 0:
        password += e[count_e]
        count_e += 1
    else:
        password += t[count_t]
        count_t += 1
print(password)

Submission status: Accepted

Solution code:
o = list(input())
e = list(input())
ans = ''
for i in range(len(e)):
    ans+=o.pop(0)
    ans+=e.pop(0)
if o:
    ans+=o.pop(0)
print(ans)

Submission status: Accepted

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