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:
a = input()
b = input()
c = len(a)-len(b)
if c==0:
    for i in range(len(a)):
        print(a[i], end ="")
        print(b[i], end ="")
else:
    for i in range(len(a)-1):
        print(a[i], end ="")
        print(b[i], end ="")
    print(a[i+1], end="")

Submission status: Accepted

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

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

print(moji)

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=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(min(len(O), len(E))):
    print(O[i], E[i], sep="", end="")
if len(O) > len(E):
    print(O[-1])

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
o = input()
e = input()
res = ''
for ao, ae in zip(o, e):
    res = res + ao + ae
if len(o) != len(e):
    res += o[-1]
print(res)

Submission status: Accepted

Solution code:
from itertools import zip_longest

O = input()
E = input()

password = ""

for o, e in zip_longest(O, E, fillvalue=""):
    password += o + e

print(password)

Submission status: Accepted

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


cont = True
i = 0
s = str()

while i < len(O):
    s += O[i]
    if cont == False:
        break
    s += E[i]
    if i == len(E)-1:
        cont = False
    i += 1
    
print(s)

Submission status: Accepted

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

l = [0]*(len(o)+len(e))

#print((len(o)+len(e))//2)

for i in range((len(o)+len(e))//2):
#	print(i)
	l[i*2] = o[i]
	l[i*2+1] = e[i]

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

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()
No = len(O)
Ne = len(E)
ls = [0]*(No+Ne)
for i in range(No):
  ls[2*i] = O[i]
for i in range(Ne):
  ls[2*i+1] = E[i]

print(*ls, sep ="")

Submission status: Accepted

Solution code:
x=list(input())
y=list(input())+[""]
for i in range(len(x)):
    print(x[i]+y[i],end="")

Submission status: Accepted

Solution code:
from sys import stdin

o = stdin.readline().rstrip()
e = stdin.readline().rstrip()

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

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

print(sn)

Submission status: Accepted

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

Submission status: Accepted

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

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

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()
print("".join([o[i // 2] if i % 2 == 0 else e[(i - 1) // 2] for i in range(len(o) + len(e))]))

Submission status: Accepted

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


main()

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
O = input()
E = input()
Olist = []
Elist = []
S = ''
for i in O:
  Olist.append(i)
for i in E:
  Elist.append(0)
  Elist.append(i)
for i in range(len(Elist)):
  if i % 2 ==0 :
    Elist[i] = Olist[int(i/2)]
for i in range(len(Elist)):
  S = S + Elist[i]
if len(O) > len(E):
  print(S + O[-1])
else:
  print(S)

Submission status: Accepted

Solution code:
import numpy as np

O=list(input())
E=list(input())
lenOE=len(O)+len(E)

if lenOE%2==1: # もしOとEを足して奇数長なら、都合のためにダミーを最後に足す
    E+="."

print("".join(np.asarray([O,E]).T.reshape(-1,)[:lenOE]))

Submission status: Accepted

Solution code:
#
# 　　  ⋀_⋀　 
#　　  (･ω･)  
# .／ Ｕ ∽ Ｕ＼
#  │＊　合　＊│
#  │＊　格　＊│ 
#  │＊　祈　＊│ 
#  │＊　願　＊│ 
#  │＊　　　＊│ 
#      ￣
#
import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,ceil,sqrt,factorial,log #log2ないｙｐ
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
inf=float('inf')
mod = 10**9+7
def pprint(*A): 
    for a in A:     print(*a,sep='\n')
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
    a=ST()
    b=ST()+" "
    ans = ""
    for i,s in enumerate(a):
        ans += s+b[i]
    ans.replace(" ","")
    print(ans)
if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#B
O = list(str(input()))
E = list(str(input()))
o = len(O)
e = len(E)
if o == e:
    ans = ""
    for i in range(o):
        ans+=O[i]
        ans+=E[i]
else:
    ans = ""
    for i in range(o-1):
        ans+=O[i]
        ans+=E[i]
    ans+=O[o-1]
    
print(ans)

Submission status: Accepted

Solution code:
O = str(input())
E = str(input())
ans = []
for i in range(len(E)):
    ans.append(O[i])
    ans.append(E[i])
    
if len(O) - len(E) == 1:
    ans.append(O[len(O)-1])
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 = list(input())
e = list(input())
c = ""
for i in range(len(o)):
    c += o[i]
    if i < len(e):
        c += e[i]

print(c)

Submission status: Accepted

Solution code:
a= input()
b = input()
for i in range(len(a)*2):
    if i%2:
        if i//2>=len(b):
            continue
        print(b[i//2],end='')
    else:
        if i//2 >= len(a):
            continue
        print(a[i//2],end='')
print()

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

password = []

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

if len(o) > len(e):
    password.append(o[-1])

password = ''.join(password)
print(password)

Submission status: Accepted

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

Submission status: Accepted

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

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

print(Answer)

Submission status: Accepted

Solution code:
o = input()
e = input()
n = len(o+e)

ans = ""
for i in range(n):
    if i % 2 == 0:
        ans += o[i//2]
    else:
        ans += e[i//2]
print(ans)

Submission status: Accepted

Solution code:
#data input
o = input()
e = input()
#processing
ans = ""
if len(o) - len(e) == 0 : #length equal
    for i in range(len(e)) :
        ans += (o[i] + e[i])
    print(ans)
elif len(o) - len(e) == 1 :
    for i in range(len(e)) :
        ans += (o[i] + e[i])
    ans += o[-1]
    print(ans)

Submission status: Accepted

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

S = []
while True:
    if not O: break
    S += O.pop()
    if not E: break
    S += E.pop()
print("".join(S))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
from functools import reduce
import copy
import math
from pprint import pprint
import collections
import bisect


sys.setrecursionlimit(4100000)


def inputs(num_of_input):
    ins = [input() for i in range(num_of_input)]
    return ins


def int_inputs(num_of_input):
    ins = [int(input()) for i in range(num_of_input)]
    return ins


def solve(inputs):
    O = list(inputs[0])
    E = list(inputs[1])
    O.reverse()
    E.reverse()

    s = []
    for i in range(len(E)):
        s.append(O.pop())
        s.append(E.pop())
    if len(O) != 0:
        s.append(O.pop())
    return ''.join(s)


def string_to_int(string):
    return list(map(int, string.split()))


if __name__ == "__main__":
    ret = solve(inputs(2))
    print(ret)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
O = list(str(input()))
E = list(str(input()))
count = len(O) - len(E)
ans = ''

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

Submission status: Accepted

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

no = len(o)
ne = len(e)
i = 0
oi = 0
ei = 0
s = ''
while i < no+ne:
    if i % 2 != 0 and oi < no:
        s += o[oi]
        oi += 1
    elif i % 2 == 0 and ei < ne:
        s += e[ei]
        ei += 1
    i += 1

print(s)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
o=list(input())
e=list(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:
a=input()
b=input()
d=zip(a,b)
e="".join(i[0]+i[1] for i in d)
if len(a)==len(b):
	print(e)
elif len(a)>len(b):
  	print(e+a[-1])
elif len(a)<len(b):
  	print(e+b[-1])

Submission status: Accepted

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

l = len(o)+len(e)+1
r = ''
o_count = 0
e_count = 0
for i in range(1, l):
  if i % 2 == 0:
    r += e[i - (2 + o_count)]
    o_count += 1
  else:
    r += o[i - (1 + e_count)]
    e_count += 1

print(r)

Submission status: Accepted

Solution code:

def examB():
    O = S()
    E = S()
    E += " "
    ans = ""
    for i in range(len(O)):
        ans = ans + O[i] + E[i]
    if len(O)!=len(O):
        ans = ans[:len(E)+1]
    print(ans)



import sys
import copy
import bisect
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def S(): return sys.stdin.readline().strip()
mod = 10**9 + 7
inf = float('inf')

examB()

Submission status: Accepted

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

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:
# ABC 058: B – ∵∴∵
o, e = [input() for _ in range(2)]

password = ''

if len(o) == len(e):
    for i in range(len(o)):
        password += o[i] + e[i]
elif len(o) > len(e):
    password += o[0]

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

print(password)

Submission status: Accepted

Solution code:
O = input()
E = input()
lenE = len(E)
res = ""

for i in range(len(O)):
    res += O[i]
    if i < lenE: res += E[i]

print(res)

Submission status: Accepted

Solution code:
# ABC058 B - ∵∴∵
from collections import deque
si = lambda: input()
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))

O = si()
E = si()
N = len(O) + len(E)

O = [ o for o in O]
E = [ e for e in E]
O = deque(O)
E = deque(E)
ans = ''

for i in range(N):
    if i%2==0:
        ans += O.popleft()
    else:
        ans += E.popleft()
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
O=str(input())
E=str(input())
data=[O[i]+E[i] for i in range(len(E))]
if len(O)!=len(E):
    data.append(O[-1])
print(''.join(data))

Submission status: Accepted

Solution code:
def main(o, e):
    for _o, _e in zip(o, e):
        print(_o + _e, end='')

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


if __name__ == "__main__":
    o = input()
    e = input()

    main(o, e)

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(O)):
    if i < len(E):
        ans += O[i] + E[i]
    else:
        ans += O[i]

print(ans)

Submission status: Accepted

Solution code:
odd = input()
even = input()
if len(odd) != len(even):
    even = even + "\n"
password = ""
for o, e in zip(odd, even):
    password = password + o + e

print(password, end="")

Submission status: Accepted

Solution code:
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpln(n): return list(int(sys.stdin.readline()) for i in range(n))

s = input()
t = input()
n = len(s)
m = len(t)
L = ''
for i in range(n):
    L += s[i]
    if i >= m:
        continue
    L += t[i]
print(L)

Submission status: Accepted

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

L=[0]*(len(a)*2)

def AA(p):
      for i in range(p):
          L[i*2]=a[i]
          L[i*2+1]=b[i]

if len(a)==len(b):
  AA(len(a))
else:
  AA(len(a)-1)
  L[-2]=a[-1]
  del L[-1]
 
print("".join(L))

Submission status: Accepted

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

L=[0]*(len(a)*2)

if len(a)==len(b):
    for i in range(len(a)):
        L[i*2]=a[i]
        L[i*2+1]=b[i]
else:
  for i in range(len(a)-1):
    L[i*2]=a[i]
    L[i*2+1]=b[i]
  L[-2]=a[-1]
  del L[-1]
 
print("".join(L))

Submission status: Accepted

Solution code:
O = input()
E = input()
E += ' '
result = ''
for s1, s2 in zip(O, E):
    result += s1 + s2
    result = result.replace(' ','')
print(result)

Submission status: Accepted

Solution code:
a=input()
b=input()
n=[]
for i in range(len(a)):
  n.append(a[i])
  if i<=len(b)-1:
    n.append(b[i])
print("".join(n))

Submission status: Accepted

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

for i in range(len(O)):
    print(O[i], end='')
    if not len(E) == i:
        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:
o = list(input())
e = list(input())

ans = list('a' * (len(o) + len(e)))
tmp = 0
for i in range(0, len(ans), 2):
    ans[i] = o[tmp]
    tmp += 1
tmp = 0
for i in range(1, len(ans), 2):
    ans[i] = e[tmp]
    tmp += 1
print("".join(ans))

Submission status: Accepted

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

Submission status: Accepted

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

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

lo = len(o)
le = len(e)
i = 0
res = []
while True:
    if i == len(o):
        break
    else:
        res.append(o[i])
    if i == len(e):
        break
    else:
        res.append(e[i])
        i += 1

print(''.join(res))

Submission status: Accepted

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

if len(o)-len(e)==1:
  s=["a"]*(2*len(e)+1)
else:
  s=["a"]*(2*len(e))

for i in range(len(o)):
  s[i*2]=o[i]

for j in range(len(e)):
  s[j*2+1]=e[j]

for k in s:
  print(k,end="")

print("")

Submission status: Accepted

Solution code:
O = input()
E = input()
ans = []
for i in range(len(list(E))):
    ans.append(O[i])
    ans.append(E[i])
if len(list(O)) != len(list(E)):
    ans.append(O[-1])
print("".join(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 not(len(E) == len(O)):
  print(O[len(O) - 1])

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()
dif_len = len(O) - len(E)
password = ''

if dif_len == 0:
    for i in range(len(O)):
        password += O[i] + E[i]
elif dif_len > 0:
    for i in range(len(O)):
        if i != len(O) - 1:
            password += O[i] + E[i]
        else:
            password += O[i]

print(password)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
o=str(input())
e=str(input())
for i in range(len(e)):
    k=2*i
    o=o[:k+1]+e[i]+o[k+1:]
print(o)

Submission status: Accepted

Solution code:
#n = int(input())
#n,k = map(int,input().split())
#x = list(map(int,input().split()))

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

Submission status: Accepted

Solution code:
X = input()
Y = input()
l = min(len(X),len(Y))
m = max(len(X),len(Y))
for i in range(l):
    if i==0:
        word = X[0]+Y[0]
    else:
        word += X[i]+Y[i]
x,y = [X],[Y]
if len(X) < len(Y):
    word += ''.join(y[0][l:])
    print(word)
elif len(X) > len(Y):
    word += ''.join(x[0][l:])
    print(word)
else:
    print(word)

Submission status: Accepted

Solution code:
O = input()
E = input()
str = ""
i = 0
while True:
  str += O[i]
  str += E[i]
  i+=1
  if len(E)-1<i:break
if len(O)-len(E)==1:
  str+=O[-1]
print(str)

Submission status: Accepted

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

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

print(answer)

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

Submission status: Accepted

Solution code:
O = input().strip()
E = input().strip()
x = ""
for i in range(2*len(E)):
    if i%2==0:
        x += O[i//2]
    else:
        x += E[i//2]
if len(O)>len(E):
    x += O[-1]
print(x)

Submission status: Accepted

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

for i in range(len(even)):
    pw+=odd[i]+even[i]
if len(odd)!=len(even):
    pw+=odd[-1]

print(pw)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
O = input()
E = input()
answer = ""
i = 1
o = 0
e = 0
while i < len(E)+len(O)+1:
  if i % 2 != 0:
    answer += O[o]
    o += 1
  else:
    answer += E[e]
    e += 1
  i += 1

print(answer)

Submission status: Accepted

Solution code:
S = input()
E = input()
ans = ''
if len(S) - len(E) == 0:
  for i in range(len(S)):
    ans = ans + S[i] + E[i]
else:
  for i in range(len(E)):
    ans = ans + S[i] + E[i]
    if i == len(E) - 1:
      ans += str(S[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:
s1=input()
s2=input()
n=len(s1)
ans=''
for i in range(min(len(s1),len(s2))):
    ans+=s1[i]+s2[i]
#print(i)
if i!=len(s1)-1:
    ans+=s1[i+1]
if i!=len(s2)-1:
    ans+=s2[i+1]
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
O = input()
E = input()
for i, j in zip(O, E):
    print(i, end='')
    print(j, end='')
if len(O) > len(E):
    print(O[-1], end='')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x=input()
y=input()

result=[]
for i in range(len(y)):
  result.append(x[i]+y[i])
if len(x) - len(y) == 1:
  result.append(x[len(x)-1])
print("".join(result))

Submission status: Accepted

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

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

Submission status: Accepted

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

result = ""

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

print(result)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
O,E = [input() for i in range(2)]
password = ""
for j in range(len(O)):
    password += O[j]
    if j < len(E):
        password += E[j]
    else:
        break
print(password)

Submission status: Accepted

Solution code:
from itertools import zip_longest

o, e = (input() for _ in range(2))

print(''.join(''.join(x) for x in zip_longest(o, e, fillvalue='')))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
odd = list(input())
even = list(input())+[""]
r = ""
for o, e in zip(odd, even):
  r += o+e
print(r)

Submission status: Accepted

Solution code:
# abc 058 B
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  = 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(o)):
  ans.append(o[i])
  if i==(len(o)-1):
    if len(o)==len(e):
      ans.append(e[i])
  else:
    ans.append(e[i])

ans="".join(ans)
print(ans)

Submission status: Accepted

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

chars = [''] * (len(o) + len(e))
for i in range(len(chars)):
    if i % 2 == 0:
        chars[i] = o[i//2]
    else:
        chars[i] = e[i//2]

ans = ''.join(chars)
print(ans)

Submission status: Accepted

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

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 = 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()
password = ""
for i, one_o in enumerate(o):
  if i < len(e):
    password += one_o + e[i]
  else:
    password += one_o
print(password)

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:
o = input()
e = input()
list = []
for i in range(len(o)-1):
  list.append(o[i] + e[i])
  
if len(e) == len(o):
  list.append(o[len(o)-1] + e[len(e)-1])
else:
  list.append(o[len(o)-1])
  
 
print(*list, sep='')

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 = list(input())
e = list(input()) + ['']

s = ''
for i,j in zip(o,e):
  s += i + j
  
print(s)

Submission status: Accepted

Solution code:
o = list(input())
e = list(input()) + ['']
lo = len(o)

s = ''
for i in range(lo):
  s += o[i]
  s += e[i]
  
print(s)

Submission status: Accepted

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

s = ''
for i in range(lo-1):
  s += o[i]
  s += e[i]

s += o[lo-1]
if lo==le:
  s += e[le-1]
  
print(s)

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

Submission status: Accepted

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

Submission status: Accepted

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

len_o = len(o)
len_e = len(e)

ans = ''
for i in range(max(len_o, len_e)):
    if i < len_o:
        ans += o[i]
    if i < len_e:
        ans += e[i]

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def slove():
    import sys
    input = sys.stdin.readline
    o = str(input().rstrip('\n'))
    e = str(input().rstrip('\n'))
    ans = []
    for i in range(51):
        if i < len(o):
            ans.append(o[i])
        if i < len(e):
            ans.append(e[i])
    print("".join(ans))


if __name__ == '__main__':
    slove()

Submission status: Accepted

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

N=len(O)
M=len(E)

ans=['null' for a in range(N+M)]

for n in range(N):
  ans[2*n]=O[n]

for m in range(M):
  ans[2*m+1]=E[m]

print(''.join(ans))

Submission status: Accepted

Solution code:
o, e = input(), input()
s = ''
o_idx = 0
e_idx = 0
i = 0
while o_idx < len(o) or e_idx < len(e):
    if i % 2 == 0:
        s += o[o_idx]
        o_idx += 1
    else:
        s += e[e_idx]
        e_idx += 1
    i += 1
print(s)

Submission status: Accepted

Solution code:
a=input()
b=input()
s=[""]*(101)
for i in range(len(a)):
    s[2*i+1]=a[i]
for j in range(len(b)):
    s[2*j+2]=b[j]
print("".join(s))

Submission status: Accepted

Solution code:
a = input()
b = input()
ans = ''
for i in range(max(len(a), len(b))):
    if i < len(a):
        ans += a[i]
    if i < len(b):
        ans += b[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="")