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: Wrong Answer

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

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

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

Submission status: Wrong Answer

Solution code:
from __future__ import print_function

o = raw_input()
e = raw_input()

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

Submission status: Wrong Answer

Solution code:
print('文字列の入力: asdfgh')
msg1 = list(input())
print('文字列の入力: asdfgh')
msg2 = list(input())
ans=[]
j=0
k=0
for i in range(len(msg1)+len(msg2)):
	if i % 2 ==0:
		ans.insert(i,msg1[j])
		j+=1
	else:
		ans.insert(i,msg2[k])
		k+=1
print('%s'% ans)

Submission status: Wrong Answer

Solution code:
a = input()
b = input()
n = len(b)
x = 0
i = 0
j = 0
while (x < n * 2):
    if x % 2:
        print(b[i], end = '')
        i += 1
    else:
        print(a[j], end = '')
        j += 1
    x += 1
print('')

Submission status: Wrong Answer

Solution code:
a = list(input())
b = list(input())
b.append("__DUMMY__")
c = sum(map(list, zip(a, b)), [])
print(c)
print("".join(c).replace("__DUMMY__", ""))

Submission status: Wrong Answer

Solution code:
a = list(input())
b = list(input())
c = sum(map(list, zip(a, b)), [])
print("".join(c))

Submission status: Wrong Answer

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

if len(y) - len(x) > 0:
    x.append('')

for a,b in zip(x,y):
    print(a+b,end='')

Submission status: Wrong Answer

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

if len(y) - len(x) > 0:
    x.append('')

print(x,y)

for a,b in zip(x,y):
    print(a+b,end='')

Submission status: Wrong Answer

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

c=min(len(a),len(b))

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

print("")

Submission status: Wrong Answer

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

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

print ans

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a=list(input())
b=list(input())
d=""
for i in range(0,len(b)-1):
    c=a[i]+b[i]
    d=d+c
if len(b)+1 == len(a):
    d = d+ a[len(a)-1]


print(d)

Submission status: Wrong Answer

Solution code:
a=list(input())
b=list(input())
d=""
for i in range(0,len(b)-1):
    c=a[i]+b[i]
    d=d+c
    if len(b)+1 == len(a):
        d = d+ a[len(a)-1]


print(d)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

# print(O, E)
str = ""
for i, j in zip (O, E):
#     print(i, j)
    str = str + i+j

print(str)

Submission status: Wrong Answer

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

for _a, _b in zip(a, b):
    print(_a, _b, end='')
if len(b) > len(a):
    print(b[-1])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys

ostr = sys.stdin.readline().strip()
estr = sys.stdin.readline().strip()

num = len(estr)
ans = ""

for i in range(num):
    ans += ostr[i] + estr[i]

print(ans)

Submission status: Wrong Answer

Solution code:
import sys

ostr = sys.stdin.readline().strip()
estr = sys.stdin.readline().strip()

num = min(len(ostr), len(estr))
ans = ""

for i in range(num):
    ans += ostr[i] + estr[i]

print(ans)

Submission status: Wrong Answer

Solution code:
s=input()+input()[::-1]
for i in range(len(s)//2):print(s[i]+s[~i],end='')
print(s[-~len(s)//2]if len(s)&1else'')

Submission status: Wrong Answer

Solution code:
o = raw_input()
e = raw_input()
s = ''
for c,d in zip(o,e):
	s += c + d
print s

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s_vec1 = input()
s_vec2 = input()
def abc_057_2(o,e):
    s_vec3 = []
    for i in range(0,len(e)):
        s_vec3.append(o[i])
        s_vec3.append(e[i])
    if len(o) == len(e):
        pass
    else:
        s_vec3.append(o[i+1])
    return(''.join(s_vec3))
abc_057_2(s_vec1,s_vec2)

Submission status: Wrong Answer

Solution code:
o = input()
e = input()
for i,a in enumerate(o):
    for j,b in enumerate(e):
        if(i == j):
            print(a + b, end = '')
    if i == len(o) - 1:
        print(a)

Submission status: Wrong Answer

Solution code:
O = raw_input()
E = raw_input()
ans = ""
for o, e in zip(O, E):
    ans += o
    ans += e
print ans

Submission status: Wrong Answer

Solution code:
n=input()
m=input()

if len(n)>len(m):
	m+" "
elif len(n)<len(m):
	n+" "
else:
	pass

s=""
for i in range(len(m)):
	s=s + n[i] + m[i]

print(s.strip())

Submission status: Wrong Answer

Solution code:
n=input()
m=input()
n=n[::2]
m=m[1::2]
if len(n)>len(m):
	m+" "
elif len(n)<len(m):
	n+" "
else:
	pass
 
s=""
for i in range(len(m)):
	s=s + n[i] + m[i]
 
print(s.strip())

Submission status: Wrong Answer

Solution code:
odd_line = input()
even_line = input()

res = ""
for o, e in zip(odd_line, even_line):
    res += (o + e)

print(res)

Submission status: Wrong Answer

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

s = "".join(i+j for i, j in zip(O, E))
print(s)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from sys import stdin
a = stdin.readline().strip()
b = stdin.readline().strip()
l = len(b)
ans = ''
for i in xrange(l):
 ans += a[i] + b[i]
if len(b)!=l:
 ans += a[-1]
print ans

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
O = "test"#raw_input()
E = "abas2"#raw_input()
out = O+E
out =  list(out)
for count in range(0,len(out)/2):
	out[2*count] = O[count]
	out[2*count+1] = E[count]
if len(O) > len(E):
	out[2*count+2] = O[count+1]
print out

Submission status: Wrong Answer

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

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

    flg = True if len(o) > len(e) else False
    result = ""

#    for i in range(len(e)):
#        tmp = o[i] + e[i]
#        result += tmp

    if flg:
        result += o[-1]

    print(result)

Submission status: Wrong Answer

Solution code:
a = input(); b = input(); "".join(map("".join, zip(a, b))) + (a[-1] if len(a) is not len(b) else "")

Submission status: Wrong Answer

Solution code:
a = input()
b = input()
"".join(map("".join, zip(a, b))) + (a[-1] if len(a) is not len(b) else "")

Submission status: Wrong Answer

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

pas = [a+b for a,b in zip(O,E)]

for i in pas:
    print(i, end="")

Submission status: Wrong Answer

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

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

    flg = True if len(o) > len(e) else False
    result = ""

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

    if flg:
        result += e[-1]

    print(result)

Submission status: Wrong Answer

Solution code:
O = input()
E = input()
print("".join(i+j for i, j in zip(O, E)))

Submission status: Wrong Answer

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

pas = [a+b for a,b in zip(O,E)]
a = ""

for i in pas:
    a = a + i
    #print(i, end="")
print(a)

Submission status: Time Limit Exceeded

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

print(c)

Submission status: Accepted

Solution code:
#n = int(input())
#a, b = map(int,input().split())
#l = list(map(int,input().split()))
#l = [list(map(int,input().split())) for i in range(n)]
o = list(input())
e = list(input())
oc = 0
ec = 0

ans = ''

n = len(o)+len(e)
for i in range(1,n+1):
    if i % 2 == 0:
        add = e[ec]
        ec += 1
    else:
        add = o[oc]
        oc += 1
    ans += add

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
o=list(input())
e=input()
for i in range(len(e)):
    o.insert(2*i+1,e[i])
print(*o,sep="")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
o = [a for a in str(input())]
e = [b for b in str(input())]
ans = []
for i in range(len(e)):
  ans.append(o[i])
  ans.append(e[i])
if len(o) > len(e):
  ans.append(o[-1])
print("".join(ans))

Submission status: Accepted

Solution code:
s1 = input()
s2 = input()
ans = ""
for i,j in zip(s1, s2):
  ans += (i + j)
  
if len(s1) != len(s2):
  ans += s1[-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) == 1:
  print(o[-1])

Submission status: Accepted

Solution code:
def answer(o: str, e: str) -> str:
    result = ''
    e += ' '
    for i in range(len(o)):
        result += o[i] + e[i]

    return result.strip()


def main():
    o = input()
    e = input()
    print(answer(o, e))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
li_o = input()
li_e = input()
an = ''
for i in range(len(li_o)):
    an += li_o[i]
    if i != len(li_e):
        an += li_e[i]
    else:
        break
print(an)

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:
#-*-coding:utf-8-*-
import sys
input=sys.stdin.readline

def main():
    O = input().rstrip()
    E = input().rstrip()
    password=""
    last = ""

    if len(O) > len(E):
        last = O[-1]
    elif len(O) < len(E):
        last = E[-1]
    else:
        last=""

    for p1,p2 in zip(O,E):
        password+=p1+p2
    print(password+last)

if __name__=="__main__":
    main()

Submission status: Accepted

Solution code:
o = list(input())
e = list(input())
s = []
t = ""
if len(o+e) % 2 == 0:
    for i in range(int(len(o+e)/2)):
        s.append(o[i]+e[i])
    t = t.join(s)
else:
    for i in range(int(len(o+e)/2)):
        s.append(o[i]+e[i])
    t = t.join(s)
    t = t + o[int(len(o+e)/2)]

print(t)

Submission status: Accepted

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

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:
#!/usr/bin/env python3

def main():
    a = list(input())
    b = list(input()) + [""]
    for i in range(len(a)):
        print(a[i], end="")
        print(b[i], end="")


if __name__ == "__main__":
    main()

Submission status: Accepted

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

def main():
    a = input()
    b = input()
    for i in range(len(a)):
        print(a[i], end="")
        if i < len(b):
            print(b[i], end="")
    print()


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
#from statistics import median
#import collections
#aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]
from math import gcd
from itertools import combinations,permutations,accumulate, product # (string,3) 3回
#from collections import deque
from collections import deque,defaultdict,Counter
import decimal
import re
import math
import bisect
import heapq
#
#
#
# pythonで無理なときは、pypyでやると正解するかも！！
#
#
# my_round_int = lambda x:np.round((x*2 + 1)//2)
# 四捨五入g
#
# インデックス系
# int min_y = max(0, i - 2), max_y = min(h - 1, i + 2);
# int min_x = max(0, j - 2), max_x = min(w - 1, j + 2);
#
#
import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7
#mod = 9982443453
#mod = 998244353
INF = float('inf')
from sys import stdin
readline = stdin.readline
def readInts():
  return list(map(int,readline().split()))
def readTuples():
    return tuple(map(int,readline().split()))
def I():
    return int(readline())
o = input()
e = input()
ans = ""
for i in range(len(o)):
    ans += o[i]
    if i >= len(e):
        pass
    else:
        ans += e[i]
print(ans)

Submission status: Accepted

Solution code:
o = list(input())
e = list(input()) + [""]
ans = "".join(o + e for o, e in zip(o, e))
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):
        print(e[i], end="")
print()

Submission status: Accepted

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

Submission status: Accepted

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

res = ""
for i, j in zip(o, e):
    res += i + j
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(e)):
    ans += o[i]+e[i]

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

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

o.reverse()
e.reverse()

n = len(o)+len(e)

ans = []
for i in range(n):
    if i%2 == 0:
        ans.append(o.pop())
    else:
        ans.append(e.pop())
print(''.join(ans))

Submission status: Accepted

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

ans = ""
for i in range(1, len(a) + len(b) + 1):
  if i % 2 == 1:
    ans += a[i // 2]
  else:
    ans += b[i // 2 - 1]
    
print(ans)

Submission status: Accepted

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

ans = ''

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

print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()
t=input()
ans=""
for i in range(max(len(s),len(t))):
  if i < len(s):
    ans += s[i]
  if i < len(t):
    ans += t[i]
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
o = input()
e = input()
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:
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=[]
i=1
j=0
while True:
    if i%2==0:
        s.append(e[j])
        i+=1
        j+=1
    else:
        s.append(o[j])
        i+=1
    if i>=len(o)+len(e)+1:
        break
for i in range(len(s)):
    print(s[i],end="")

Submission status: Accepted

Solution code:
o = input()
e = input()
res = ""
n = min(len(o), len(e))
for i in range(n):
    res += o[i] + e[i]

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

print(res)

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:
a = list(input())
b = list(input())

for i in range(0, len(a) + len(b)):
    if i % 2 == 0:
        print(a.pop(0), end = "")
    else:
        print(b.pop(0), end = "")

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)

o = input().strip()
e = input().strip()

ans = []
for i, v in enumerate(o):
    ans.append(v)
    if (i != len(o) - 1) or (len(o) == len(e)):
        ans.append(e[i])
print(''.join(ans))

Submission status: Accepted

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

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

if len_o == len_e:
  for i in range(len_o):
    ans += o[i]
    ans += e[i]
elif len_o > len_e:
  for i in range(len_e):
    ans += o[i]
    ans += e[i]
  for i in range(len_e, len_o):
    ans += o[i]
else:
  for i in range(len_o):
    ans += o[i]
    ans += e[i]
  for i in range(len_o, len_e):
    ans += e[i]
print(ans)

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

Submission status: Accepted

Solution code:


def read_int():
    return int(input().strip())


def read_ints():
    return list(map(int, input().strip().split(' ')))


def solve():
    O = input().strip()
    E = input().strip()
    answer = [None]*(len(O)+len(E))
    for i in range(len(O)):
        answer[2*i] = O[i]
    for i in range(len(E)):
        answer[2*i+1] = E[i]
    return ''.join(answer)


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
from collections import deque


def read():
    O = input().strip()
    E = input().strip()
    return O, E


def solve(O, E):
    ans = []
    oq = deque(O)
    eq = deque(E)
    while eq:
        ans.append(oq.popleft())
        ans.append(eq.popleft())
    if oq:
        ans.append(oq.popleft())
    return "".join(ans)


if __name__ == '__main__':
    inputs = read()
    outputs = solve(*inputs)
    if outputs is not None:
        print("%s" % str(outputs))

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:
a = list(input())
b = list(input())
f = False
x = []
if len(a)> len(b):
    b.append(0)
    f = True
for i in range(len(a)):
    x.append(a[i])
    x.append(b[i])
if f:
    x.pop()
print("".join(x))

Submission status: Accepted

Solution code:
def main():
    o, e = input(), input()
    ans = ""

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

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
def main():
    o, e = input(), input()
    len_o, len_e = len(o), len(e)
    ans = ""

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

    if len_o == len_e + 1:
        ans += o[-1]

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

res = []

if len(O) - len(E) == 0:
    for i, j in zip(O, E):
        res.append(i)
        res.append(j)
else:
    E.append('')
    for i, j in zip(O, E):
        res.append(i)
        res.append(j)
    res.pop(-1)
 
pw = ''.join(res)
print(pw)

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

Submission status: Accepted

Solution code:
from sys import exit
import math
import collections
ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys, re
from math import ceil, floor, sqrt, pi, factorial, gcd
from copy import deepcopy
from collections import Counter, deque
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement
from bisect import bisect, bisect_left, bisect_right
from functools import reduce
from decimal import Decimal, getcontext
# input = sys.stdin.readline 
def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_str(N): return [s_list() for _ in range(N)]
def s_row_list(N): return [list(s_input()) for _ in range(N)]
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 6)
INF = float('inf')
MOD = 10 ** 9 + 7
num_list = []
str_list = []

def main():
    o = s_input()
    e = s_input()

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

    print()

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# B - ∵∴∵
def main():
    o = list(input())
    d = list(input())

    for i in range(len(o)+len(d)):
        if i % 2 == 0:
            print(o.pop(0), end='')
        else:
            print(d.pop(0), end='')

  
        
if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

if len(O) > len(E):
    print(password + O[-1])
elif len(O) < len(E):
    print(password + E[-1])
else:
    print(password)

Submission status: Accepted

Solution code:
from collections import deque
from itertools import count
Odd = deque(input())
Even = deque(input())
rtnList = lambda x: Odd if x & 1 else Even
ans = ''
for i in count(1,1):
    try:
        s = rtnList(i).popleft()
    except IndexError:
        print(ans)
        exit()
    ans += s

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#58B
A=list(input())
B=list(input())
x=A[0]+B[0]
for i in range(1,len(B)):
    x=x+A[i]+B[i]
if len(A)>len(B):
    x=x+A[-1]
print(x)

Submission status: Accepted

Solution code:
from itertools import zip_longest

def solve():
    N = input()
    O = input()
    ans = ''
    for x, y in zip_longest(N, O, fillvalue=''):
        ans += x + y
    print(ans)

if __name__ == "__main__":
    solve()

Submission status: Accepted

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

Submission status: Accepted

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

p=""

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(password)

Submission status: Accepted

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

lst = []
for oo,ee in zip(o,e):
    lst.append(oo+ee)

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

print("".join(lst))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


def main():
    from itertools import zip_longest

    o = input()
    e = input()

    res = ""
    for a, b in zip_longest(o, e, fillvalue=""):
        res += a
        res += b

    print(res)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
def main():
    O = list(input())
    E = list(input())
    O.reverse()
    E.reverse()
    ans = ''
    for _ in range(200):
        ans += O.pop()
        if len(E) == 0:
            break
        ans += E.pop()
        if len(O) == 0:
            break
    print(ans)

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
s = list(input())
t = list(input())
l = min(len(s),len(t))
if len(s)>len(t):
    x = 1
elif len(s)<len(t):
    x = 2
else:
    x = 0
for i in range(l):
    print(s[i],end = "")
    print(t[i],end = "")
if x == 1:
    print(s[-1])
elif x == 2:
    print(t[-1])

Submission status: Accepted

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

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

Submission status: Accepted

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

ans = ""
while len(O)>0:
  ans += O[:1]+E[:1]
  O = O[1:]
  E = E[1:]
print(ans)

Submission status: Accepted

Solution code:
q=str(input())
e=str(input())
a=len(q)
b=len(e)
c=""
if a==b:
  for i in range(a):
    c+=q[i]
    c+=e[i]
else:
  for i in range(b):
    c+=q[i]
    c+=e[i]
  c+=q[a-1]

print(c)

Submission status: Accepted

Solution code:
o=input()
e=input()
n=len(o)
m=len(e)
ans=[]
for i in range(m):
  ans.append(o[i])
  ans.append(e[i])
if n-m==0:
  print(*ans,sep='')
else:
  ans.append(o[n-1])
  print(*ans,sep='')

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:
import sys
sys.setrecursionlimit(4100000)
import math
import itertools
INF = float('inf')
from heapq import heapify, heappop, heappush
import collections

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