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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

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

print(ans)

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:
o = input()
e = input()
o_count = 0
e_count = 0
ans = ''
for i in range(len(o) + len(e)):
    if i % 2 == 1:
        ans += e[e_count]
        e_count += 1
    else:
        ans += o[o_count]
        o_count += 1
print(ans)

Submission status: Accepted

Solution code:
O = input()
E = input()
o = 0
e = 0
ans = ''

for i in range(len(O) + len(E)):
    if i % 2 == 0:
        ans += O[o]
        o += 1
    else:
        ans += E[e]
        e += 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], sep='', end='')
    print()
else:
    for i in range(len(E)):
        print(O[i], E[i], sep='', end='')
    print(O[-1])

Submission status: Accepted

Solution code:
#2019/09/27
O = input()
E = input()
S = []
for i in range(len(O)-1):
    S.append(O[i])
    S.append(E[i])
if (len(O) == len(E)):
    S.append(O[-1])
    S.append(E[-1])
else:
    S.append(O[-1])
    
print(*S, sep="")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
O = list(input())
E = list(input())
ans = ""
for s in range(len(O)+len(E)):
    if s%2 == 0:
        ans += O[0]
        del O[0]
    else:
        ans += E[0]
        del E[0]
print(ans)

Submission status: Accepted

Solution code:


O = input()
E = input()

ans = ''
i = 0
while i < len(E):
    ans = ans + O[i]
    ans = ans + E[i]
    i += 1

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

print(ans)

Submission status: Accepted

Solution code:
ki=list(input())
gu=list(input())

ans=''
for i in range(len(ki)+len(gu)):
    if i%2==0:
        ans+=ki[i//2]
    else:
        ans+=gu[(i-1)//2]
print(ans)

Submission status: Accepted

Solution code:
o = list(input())
e = list(input())
to = [(2*i+1,o[i])for i in range(len(o))]
te = [(2*i+2,e[i])for i in range(len(e))]
p = sorted(to+te)
print(''.join(i[1] for i in p))

Submission status: Accepted

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

# input
O = list(input())
E = list(input())

# solve & output
for i in range(len(O) + len(E)):
    if i % 2 == 0:
        print(O.pop(0), end='')
    else:
        print(E.pop(0), end='')

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

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

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

    ans += O[i+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:
o = input().rstrip()
e = input().rstrip()
res = [''] * (len(o) + len(e))
for i in range(len(o)):
    res[2 * i] = o[i]
for i in range(len(e)):
    res[2 * i + 1] = e[i]
print(''.join(res))

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:
from itertools import zip_longest
S = zip_longest(list(input()), list(input()), fillvalue='')
print(''.join(map(lambda t: ''.join(t), S)))

Submission status: Accepted

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

Submission status: Accepted

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

ans = ''

for s, t in zip(o, e):
    ans += s+t

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

print(ans)

Submission status: Accepted

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

password = ''

for s, t in zip(o, e):
    password += s
    password += t

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

print(password)

Submission status: Accepted

Solution code:
o = list(input())
e = list(input())
n = max(len(o), len(e))
ans = []

for i in range(n):
    try:
        ans.append(o[i])
        ans.append(e[i])
    except IndexError:
        pass

print(''.join(ans))

Submission status: Accepted

Solution code:
from collections import deque

O=deque(list(input()))
E=deque(list(input()))
N=max(len(O),len(E))
#print(O)
#print(E)

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

Submission status: Accepted

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

if len(o) >= len(e):
    times = len(e)
else:
    times = len(o)

for i in range(times):
  password = password + o[i]
  password = password + e[i]

if len(o) > len(e):
    password = password + o[-1]
elif len(e) > len(o):
    password = password + e[-1]

print(password)

Submission status: Accepted

Solution code:
o, e = [input() for _ in range(2)]
string = ""
for i in range(min(len(o), len(e))):
    string = string + o[i] + e[i]
if len(o) - len(e) == 1:
    string += o[-1]
print(string)

Submission status: Accepted

Solution code:
def resolve():
    o = input()
    e = input()
    if len(o) == len(e):
        ans = "".join([oi + ei for oi, ei in zip(o, e)])
    elif len(o) > len(e):
        ans = "".join([oi + ei for oi, ei in zip(o, e)]) + o[-1]
    else:
        ans = "".join([oi + ei for oi, ei in zip(o, e)]) + e[-1]
    print(ans)


if __name__ == "__main__":
    resolve()

Submission status: Accepted

Solution code:
odd_number = input()
even_number = input()
passwd = ""
for i in range(len(even_number)):
  passwd += odd_number[i]
  passwd += even_number[i]
if len(odd_number) - len(even_number) == 1:
  passwd += odd_number[len(odd_number) - 1]
print(passwd)

Submission status: Accepted

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

ol, el = len(O), len(E)

ans = ""
for i in range(min(ol, el)):
    ans += O[i] + E[i]

if ol != el:
    if ol > el:
        ans += O[-1]
    else:
        ans += E[-1]
print(ans)

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

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

Submission status: Accepted

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

S = [o, e]
j = 0
ans = ""
for i in range(len(o) + len(e)):
    ans += S[j][i//2]
    j = (j + 1) % 2

print(ans)

Submission status: Accepted

Solution code:
# B - ∵∴∵
O = str(input())
E = str(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[len(O)-1]
elif len(O) >= len(E):
    for i in range(len(O)):
        ans += O[i]+E[i]
    ans += E[len(E)-1]

print(ans)

Submission status: Accepted

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

ans = ''.join(map(lambda a: a[0] + a[1], zip(o, e)))

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

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

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
*O,=open(0);print("".join(o+e for o,e in zip(*O)))

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

Submission status: Accepted

Solution code:
even = input()
odd = input()
answer = []
for i in range(len(even)*2):
  try:
    if i%2 == 0:
        answer.append(even[i//2])
    else:
        answer.append(odd[i//2])
  except:
    pass
print(*answer,sep = "")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
even = str(input())
odd = str(input())
ans = ""
if len(even) == len(odd):
  for i in range(len(even)):
    ans += even[i] + odd[i]
  
else:
  for i in range(len(even)-1):
    ans += even[i] + odd[i]
  ans += even[-1]

print(ans)

Submission status: Accepted

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

A = list(A)
B = list(B)

AL = len(A)
BL = len(B)

b = []
for i in range(BL):
  b.append(A[i] + B[i])
if AL -BL == 1:
    # b.append(A[-1])
  b.append(A[-1])
print(",".join(b).replace(",", ""))

Submission status: Accepted

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

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

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()
l = []
while True:
    if len(o) > len(e):
        e = e + ' '
    elif len(o) < len(e):
        o = o + ' '
    else:
        break
for i, j in zip(o, e):
    l.append(i+j)
print(''.join(l).replace(' ', ''))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#インポート
import sys

#入力用
def ILI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def ISI(): return map(int, sys.stdin.readline().rstrip().split())
def II(): return int(sys.stdin.readline().rstrip())
def ISS(): return sys.stdin.readline().rstrip().split()
def IS(): return sys.stdin.readline().rstrip()

O = list(IS())
E = list(IS())
t = ""
i = 0
for i in range(len(O)):
    a = O[i]
    if len(E) != 0:
        b = E.pop(0)
        t += a + b
    else:
        t += a
print(t)

Submission status: Accepted

Solution code:
s = input().strip()
t = input().strip()
for _s, _t in zip(s, t):
  print(_s, end='')
  print(_t, end='')
if len(s) != len(t):
  print(s[-1], end='')
print()

Submission status: Accepted

Solution code:
import sys
import collections
import copy
def input(): return sys.stdin.readline().strip()
A= input()
B=input()
ans = ""
n = len(A)+len(B)
for i in range(n):
    if i%2 == 0:
        ans= ans+A[i//2]
    else:
        ans= ans+B[(i-0)//2]
print(ans)

Submission status: Accepted

Solution code:
o = input()
e = input()
ans = ''
onum = 0
enum = 0
for i in range(len(o) + len(e)):
    if i % 2 != 0:
        ans += e[enum]
        enum += 1
    else:
        ans += o[onum]
        onum += 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:
o = input()
e = input()

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

Submission status: Accepted

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

if len(o)>len(e):
  out = out+o[len(o)-1]
elif len(o)<len(e):
  out = out+e[len(e)-1]
else:
  out=out
print(out)

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:
import sys
import copy
import  math
from _bisect import *
from collections import *
from operator import itemgetter
from math import factorial
"""
from fractions import gcd
def lcm(x, y):
    return (x * y) // gcd(x, y)
"""
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline()

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

Submission status: Accepted

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

for i, j in zip(odd, even):
  print(i, j, sep = '', end = '')

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:
# ABC058b
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)

o = input()
e = input()

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

Submission status: Accepted

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


if __name__ == "__main__":
    test()

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()) + ['']
 
for x, y in zip(O, E):
  print(x + y, end = '')

Submission status: Accepted

Solution code:
O, E = list(input()), list(input())
password = ''.join([o + e for o, e in zip(O, E)])
if len(O) > len(E):
    password += O[-1]
print(password)

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())+['']
for x,y in zip (O,E):
    print(x+y,end='')

Submission status: Accepted

Solution code:
from itertools import zip_longest
O = input()
E = input()
ans = ""
for o, e in zip_longest(O, E, fillvalue=""):
  ans += (o + e)
print(ans)

Submission status: Accepted

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

ans = ''

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


print(ans)

Submission status: Accepted

Solution code:
o=input()
e=input()
for i in range(len(e)):
    print(o[i],end='')
    print(e[i],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(O) + len(E)):
  if i % 2 == 0:
    ans += O[i // 2]
  else:
    ans += E[i // 2]
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    A = list(input())
    B = list(input())
    pwd = ""
    while A and B:
        pwd += A.pop(0)
        pwd += B.pop(0)
    if A:
        pwd += A.pop(0)
    return pwd

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

Submission status: Accepted

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

Submission status: Accepted

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

s = ''
for a, b in zip(o, e):
    s += a + b
if len(o) != len(e):
    s += o[-1]
print(s)

Submission status: Accepted

Solution code:
import copy

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

s=copy.deepcopy(E)

for i in range(len(O)):
    s.insert(i*2,O[i])
  
print(''.join(s)  )

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
a=input()
b=input()
x=''
while(len(a)>0):
  x+=a[:1]
  a=a[1:]
  x+=b[:1]
  b=b[1:]
print(x)

Submission status: Accepted

Solution code:
o = list(input())
e = list(input())
e.append("")
for i,x in zip(o,e):
    print(i+x,end="")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# https://atcoder.jp/contests/abc058/tasks/abc058_b
import sys
sys.setrecursionlimit(12345678)
import itertools
from collections import Counter
from collections import defaultdict
from collections import deque
import bisect
from heapq import heappush, heappop


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

    print(ans)


if __name__ == '__main__':
    main()

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:
O = list(input())
E = list(input())
tail = ""
if len(O) < len(E):
    tail = E[-1]
elif len(E) < len(O):
    tail = O[-1]
ans = ""
for x,y in zip(O,E):
    ans += x + y
print(ans+tail)

Submission status: Accepted

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

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

if len(O) != len(E):
    print (O[-1], end = '')

print ()

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:
# n, l = list(map(int, input().split()))
o = input()
e = input()

ans = [""] * (len(o) + len(e))
ans[0] = "a"

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

if len(o) != len(e):
    ans[len(e)*2] = o[len(o)-1]

print("".join(ans))

Submission status: Accepted

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

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

Submission status: Accepted

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

ans = []
for i in range(len(a)):
    ans.append(a[i])
    if i < len(b):
        ans.append(b[i])
print(''.join(ans))

Submission status: Accepted

Solution code:
from itertools import zip_longest
print("".join(sum(zip_longest(input(), input(), fillvalue=""), tuple())))

Submission status: Accepted

Solution code:
o = input()
e = input()
for i,j in zip(o,e):
    print(i,j,sep="",end="")
print("" if len(o) == len(e) else o[-1])

Submission status: Accepted

Solution code:
A = input()
B = input()
S = list(A)
for i in range(len(B)):
  S.insert(i*2+1,B[i])
print(''.join(map(str, S)))

Submission status: Accepted

Solution code:
O, E = [list(input()) for _ in range(2)]
[print("{}{}".format(i, j), end="") for i, j in zip(O, E)]
print(O[-1]) if len(O) > len(E) else print()

Submission status: Accepted

Solution code:
o=input()
e=input()
x=""
for i in range(min([len(o),len(e)])):
    x+=o[i]
    x+=e[i]
if len(o)-len(e):
    x+=o[-1]

print(x)
#添字ずらす

Submission status: Accepted

Solution code:
O = input().strip()
E = input().strip()
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:
from itertools import zip_longest

def resolve():
    odd = input()
    even = input()

    for o, e in zip_longest(odd, even):
        if o is None:
            o = ""
        elif e is None:
            e = ""
        print(o+e, end="")
    else:
        print()

if __name__ == '__main__':
    resolve()

Submission status: Accepted

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

Submission status: Accepted

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

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, e = [input() for i in range(2)]
string = []
for i in range(len(e)):
	string.append(o[i] + e[i])
if len(o) != len(e):
  	string.append(o[-1])
print(''.join(string))

Submission status: Accepted

Solution code:
O=input()
E=input()
pw = []
for i in range(len(E)):
    pw.append(O[i])
    pw.append(E[i])
if len(O)!=len(E):
    pw.append(O[-1])
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[len(o)-1],end="")

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[len(o)-1]
	
print(ans)

Submission status: Accepted

Solution code:
str1 = list(input())
str2 = list(input())
ans = []
for i in range(len(str1)):
    ans.extend(str1[i])
    if len(str2) != len(str1) and i == len(str1) - 1:
        break
    ans.extend(str2[i])
print("".join(ans))

Submission status: Accepted

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

if len(O) > len(E):
    E.append("")

print("".join(o+e for o, e in zip(O, E)))

Submission status: Accepted

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

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 o,e in zip(O,E):
  print('{}{}'.format(o,e),end='')
if len(E)<len(O):
  print(O[-1])

Submission status: Accepted

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

for i in range(len(o)):
  print(o[i],end='')
  if len(o)>len(e) and i==len(o)-1:
    break
  print(e[i],end='')

Submission status: Accepted

Solution code:
O, E = [input() for i in range(2)]
ans = ''
if len(O) > len(E):
    E += "Z"
    for i, j in zip(O, E):
            ans += i
            ans += j
    print(ans[0:-1])
else:
    for i, j in zip(O, E):
            ans += i
            ans += j
    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()
l = len(o) + len(e)
ans = ''
for i in range(len(e)):
    ans += o[i]
    ans += e[i]
if l%2 == 1:
    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())
tmp=""
n=len(o)
if len(o)==len(e):
  for i in range(n):
    tmp+=o[i]+e[i]
else:
  for i in range(n):
    tmp+=o[i]
    if i < n-1:
      tmp+=e[i]
print(tmp)

Submission status: Accepted

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

Submission status: Accepted

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

len_o=len(O)
len_e=len(E)
if len_o < len_e:
  s+=E[len_o:]
elif len_o > len_e:
  s+=O[len_e:]
  
print(s)

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/2)],end='')
print(sep='')

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# ABC 58 B

import numpy as np

def resolve():
    O = input()
    E = input()
    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:
# -*- coding: utf-8 -*-

O = input()
E = input()

length = len(O) + len(E)

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

if length % 2:
    print(O[-1])

Submission status: Accepted

Solution code:
odd=input()
even=input()
for a,b in zip(odd,even):
    print(a+b,end='')
if len(odd)>len(even):
    print(odd[-1])
else:
    print()

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()
str = []
for i in range(len(e)):
  str.append(o[i])
  str.append(e[i])
if len(o) - len(e) == 1:
  str.append(o[-1])
print("".join(str))

Submission status: Accepted

Solution code:
o, e = [input().rstrip() for i in range(2)]
lst = []
for i in range(len(o)):
    print(o[i], end='')

    if i + 1 > len(e):
        print()
        break
    else:
        print(e[i], end='')

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=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()
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:
#!/usr/bin/env python3
import sys
INF = float("inf")


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

    return


def main():

    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    O = next(tokens)  # type: str
    E = next(tokens)  # type: str
    solve(O, E)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

password = ""

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

Submission status: Accepted

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