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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
o = list(input())
e = list(input())
w = [a + b for a, b in zip(o, e)]
print(*w, sep='')

Submission status: Wrong Answer

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

ans = ""
for i,j in zip(o, e):
    ans += (i+j)

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

Submission status: Wrong Answer

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

ans = ""
for i,j in zip(o, e):
    ans += (i+j)

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import numpy as np

print(np.array([list(input()), list(input())]))

Submission status: Wrong Answer

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

print(ans)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
O = input()
E = input()
a = ''
cnt = 0
for i in O:
    a += i
    cnt += 1
    if (len(O) == cnt)and(len(O)>len(E)):
        break
    for j in E:
        a += j
        E = E.lstrip(j)
        break
print(a)

Submission status: Wrong Answer

Solution code:
O = input()
E = input()
a = ''
cnt = 0
for i in O:
    a += i
    cnt += 1
    if len(O) == cnt:
        break
    for j in E:
        a += j
        E = E.lstrip(j)
        break
print(a)

Submission status: Wrong Answer

Solution code:
O = input()
E = input()
a = ''
cnt = 0
for i in O:
    a += i
    cnt += 1
    if cnt==len(O):
        pass
    else:
        for j in E:
            a += j
            E = E.lstrip(j)
            break
print(a)

Submission status: Wrong Answer

Solution code:
O = input()
E = input()
a = ''
for i in O:
    a += i
    for j in E:
        a += j
        E = E.lstrip(j)
        break
print(a)

Submission status: Wrong Answer

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

o = input().rstrip("\r\n")
e = input().rstrip("\r\n")
ans = ""
for i, j in zip(o, e):
    ans += i + j
print(ans)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
o=input("Enter 1st string=")
e=input("Enter 2nd string=")
s=[]
lo=len(o)
le=len(e)
if(lo<le):
    p=lo
else:
    p=le
for i in range(p):
    s.append(o[i])
    s.append(e[i])

if(lo==le):
    print(''.join(s))
elif(lo<le):
    s.append(e[le-1])
    print(''.join(s))
else:
    s.append(o[lo-1])
    print(''.join(s))

Submission status: Wrong Answer

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

ol=len(o)
el=len(e)
ou=''
if(abs(ol-el)==0 or abs(ol-el)==1):
    if(ol>1 and el<50):
        if(ol>el):
            e+=""
            for i in range(ol-1):
                ou=ou+o[i]+e[i]
        elif(ol<el):
            o+=""
            for i in range(el-1):
                ou=ou+o[i]+e[i]
        else:
            for i in range(ol):
                ou=ou+o[i]+e[i]
print(ou)

Submission status: Wrong Answer

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

i=0
j=0

s=""

while(i<len(a) and j<len(b)):
	s+=a[i]
	s+=b[j]
	i=i+1
	j=j+1

print(s)

Submission status: Wrong Answer

Solution code:
o=list(input())
m=list(input())
"""
ans=' '
for i in range(len(o)-1):
            
                        ans +=o[i]
                        ans +=m[i]

ans+=o[-1] 
print(ans)         
"""
ans=[]
for i in range(len(o)-1):
            ans.append(o[i])
            ans.append(m[i])
ans.append(o[-1])
print("".join(ans))

Submission status: Wrong Answer

Solution code:
o=list(input())
m=list(input())
ans=' '
for i in range(len(o)-1):
            
                        ans +=o[i]
                        ans +=m[i]

ans+=o[-1] 
print(ans)

Submission status: Wrong Answer

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

ans=' '
for i in range(len(o)):
            for j in range(len(m)):
                        ans +=o[i]
                        ans +=m[j]
                        
print(ans)

Submission status: Wrong Answer

Solution code:
o = input()
e = input()
pword = []

for i in range(len(e)):
    pword.append(o[i])
    pword.append(e[i])
    if len(o)>len(e):
        pword.append(o[i+1])
print("".join(pword))

Submission status: Wrong Answer

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

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

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

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

Submission status: Wrong Answer

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

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

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

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

Submission status: Wrong Answer

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

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

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

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

Solution code:
A=list(input())
B=list(input())
L=[]
for a,b in zip(A,B):
    L.append(a)
    L.append(b)
print("".join(L))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

for i, j in zip(o, e):
  print(i+j, end="")

Submission status: Wrong Answer

Solution code:
o=input()
e=input()
for i in range(50):
	try:
		print(o[i]+e[i],end="")
	except:
		pass

Submission status: Wrong Answer

Solution code:
o = input()
e = input()
lis = []
for i in range(min(len(o),len(e))):
    lis.append(o[i])
    lis.append(e[i])
if len(o)>len(e):
    lis.append(o[-1])
elif len(o)==len(e):
    lis.append(o[-1])
    lis.append(e[-1])

print(''.join(lis))

Submission status: Wrong Answer

Solution code:
o = input()
e = input()
lis = []
for i in range(max(len(o),len(e))-1):
    lis.append(o[i])
    lis.append(e[i])
if len(o)>len(e):
    lis.append(o[-1])
elif len(o)==len(e):
    lis.append(o)
    lis.append(e)

print(''.join(lis))

Submission status: Wrong Answer

Solution code:
ol = input()
el = input()
ans = ''
for o, e in zip(ol, el):
    ans += o + e

print(ans)

Submission status: Wrong Answer

Solution code:
o = input()
e = input()
print(o,end="")
print(e,end="")

Submission status: Wrong Answer

Solution code:
O = list(input())
E = list(input())
N = len(O)+len(E)
if len(O)>len(E):
    E += ' '
elif len(O)<len(E):
    O += ' '
print(E)
print(O)
answer = []
for i,j in zip(O,E):
    answer.append(i)
    answer.append(j)
print(''.join(answer))

Submission status: Wrong Answer

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

ans=[]

for oo,ee in zip(o,e):
    ans.append(oo+ee)

print("".join(ans))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, log2
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
from bisect import bisect

def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

O = input()
E = input()

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

Submission status: Wrong Answer

Solution code:
import sys

O = list(input())
E = list(input())
for o, e in zip(O, E):
    sys.stdout.write(o + e)
if len(O) - len(E) == 1:
    sys.stdout.write(E[-1])
print()

Submission status: Wrong Answer

Solution code:
import sys

O = list(input())
E = list(input())
for o, e in zip(O, E):
    sys.stdout.write(o + e)
print()

Submission status: Wrong Answer

Solution code:
"""
author : halo2halo
date : 31, Jan, 2020
"""

import sys

# import itertools
# import numpy as np

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

O, E = read().decode('utf8').split()
O.rstrip()
E.rstrip()
ans = [i+j for i, j in zip(O, E)]

print(''.join(ans))

Submission status: Wrong Answer

Solution code:
"""
author : halo2halo
date : 31, Jan, 2020
"""

import sys

# import itertools
# import numpy as np

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

O, E = read().decode('utf8').split()
ans = [i+j for i, j in zip(O, E)]

print(''.join(ans))

Submission status: Wrong Answer

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(e[-1])

Submission status: Wrong Answer

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

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

print()

Submission status: Wrong Answer

Solution code:
a = input()
b = input()+""
for c,d in zip(a,b):
  print(c+d,end="")

Submission status: Wrong Answer

Solution code:
a = input()
b = input()
for c,d in zip(a,b):
  print(c+d,end="")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

for i,j in zip(o,e):
  print(o,e,sep='',end='')

Submission status: Wrong Answer

Solution code:
s1=input()
s2=input()
ans=''
for ss1,ss2 in zip(s1,s2):
  ans+=ss1+ss2
  
print(ans)

Submission status: Wrong Answer

Solution code:
#codng utf-8
O=[i for i in input()]
E=[i for i in input()]
m=len(O)
n=len(E)
ans=''
for i in range(len(O)-1):
    ans+=O[i]
    ans+=E[i]
if len(O)-len(E)==0:
    ans+=O[n-1]
    ans+=E[n-1]
    print(ans)
else:
    ans+=O[n-1]
    print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
o = input()
e = input()
ans = []

for t, v in zip(o,e):
	ans.append(t)
	ans.append(v)

print("".join(ans))

Submission status: Wrong Answer

Solution code:
O, E = [input() for _ in range(2)]
pass_word = []
for i in range(len(E)):
  if len(O) < len(E) and i == len(E) - 1:
    pass_word.append(E[i])
  else:
    pass_word.append(O[i])
    pass_word.append(E[i])

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
odd_num = input()
even_num = input()

print(''.join([x + y for x, y in zip(odd_num, even_num)]))

Submission status: Wrong Answer

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

for a, b in zip(o, e):
    print(a+b, end='')

Submission status: Wrong Answer

Solution code:
o, e = [list(input()) for _ in range(2)]
ans = []
for i in range(len(o)):
  ans.append(o[i])
  if len(o)==len(e):
    ans.append(e[i])
for j in ans:
  print(j, end='')

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline
O = list(input().rstrip())
E = list(input().rstrip())
ans = []
for i, j in zip(O, E):
    ans.append(i)
    ans.append(j)
print("".join(ans))

Submission status: Wrong Answer

Solution code:
o = str(input())
e = str(input())
lst = []

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

Submission status: Wrong Answer

Solution code:
print(*[o + e for o, e in zip(input(), input())], sep='', end='')

Submission status: Wrong Answer

Solution code:
print(*[o + e for o, e in zip(input(), input())], sep='')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

ans = [a+b for a,b in zip(o,e)]
print("".join(ans))

Submission status: Wrong Answer

Solution code:
import sys
MAX_INT = int(10e12)
MIN_INT = -MAX_INT
mod = 1000000007
sys.setrecursionlimit(1000000)
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

s = S()
t = S()

ans = ""
for ss,tt in zip(s,t):
  ans += ss + tt
print(ans)

Submission status: Wrong Answer

Solution code:
odds, evens = [input() for _ in range(2)]
chars = []
for odd, even in zip(odds, evens):
    chars.append(odd)
    chars.append(even)
ans = "".join(chars)
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
from itertools import zip_longest

O = input()
E = input()

ans = []
for o, e in zip(O, E):
    ans.append(o)
    ans.append(e)

ans = [s for s in ans if s]
print("".join(ans))

Submission status: Wrong Answer

Solution code:
O = "xyz"
O_2 = list(O)
OLEN = len(O)

E = "abc"
E_2 = list(E)
ELEN = len(E)

ans = []

if ELEN >= OLEN:
    N = ELEN
else:
    N = OLEN



if OLEN == ELEN:
    for i in range(N):
        ans.append(O_2[i])
        ans.append(E_2[i])

elif OLEN  != ELEN:
    
    for i in range(N):
        if len(ans) == ((OLEN) + (ELEN) -1):
            if OLEN > ELEN:
                ans.append(O_2[-1])
            else:
                ans.append(E_2[-1])
            break
        ans.append(O_2[i])
        ans.append(E_2[i])


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

Submission status: Wrong Answer

Solution code:
O = input()
O_2 = list(O)
OLEN = len(O)

E = input()
E_2 = list(E)
ELEN = len(E)

ans = []

if ELEN >= OLEN:
    N = ELEN
else:
    N = OLEN



if OLEN == ELEN:
    for i in range(N):
        ans.append(O_2[i])
        ans.append(E_2[i])

elif OLEN  != ELEN:
    
    for i in range(N):
        if len(ans) == ((OLEN) + (ELEN) -1):
            if OLEN > ELEN:
                ans.append(O_2[-1])
            else:
                ans.append(E_2[-1])
            break
        ans.append(O_2[i])
        ans.append(E_2[i])


print(ans)

Submission status: Wrong Answer

Solution code:
O = input()
O_2 = list(O)
OLEN = len(O)

E = input()
E_2 = list(E)
ELEN = len(E)

ans = []

if ELEN >= OLEN:
    N = ELEN
else:
    N = OLEN



if OLEN == ELEN:
    for i in range(N):
        ans.append(O_2[i])
        ans.append(E_2[i])

elif OLEN  != ELEN:
    
    for i in range(N):
        if len(ans) == ((OLEN) + (ELEN) -1):
            if OLEN > ELEN:
                ans.append(O_2[-1])
            else:
                ans.append(E_2[-1])
            break
        ans.append(O_2[i])
        ans.append(E_2[i])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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(e[-1])

Submission status: Wrong Answer

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


cont = True
i = 0
s = str()

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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(E[len(E)-1])
print(''.join(ans))

Submission status: Wrong Answer

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(E[-1])
print(''.join(ans))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

password = []

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

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
d=zip(input(),input())
print("".join(i[0]+i[1] for i in d))

Submission status: Wrong Answer

Solution code:
o=list(input())
p=list(input())
for i,j in zip(o,p):
    print(i+j,end='')

Submission status: Wrong Answer

Solution code:
o=input()
p=input()
for i,j in zip(o,p):
    print(i+j,end='')

Submission status: Wrong Answer

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="")
else:
  for i in range(len(o)):
    print(o[i],end="")
    print(e[i],end="")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

print(''.join(''.join(x) for x in zip(o, e)))

Submission status: Wrong Answer

Solution code:
odd = list(input())
even = list(input())
r = ""
last_word = ""
if len(odd) != len(even):
  last_word = max(odd, even)[-1]
for o, e in zip(odd, even):
  r += o + e
print(r+last_word)

Submission status: Wrong Answer

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

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

print(ans)

Submission status: Wrong Answer

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

ans = ''
for a, b in zip(o, e):
    ans = ans + a + b

print(ans)

Submission status: Wrong Answer

Solution code:
o=list(input())
e=list(input())
p=list(o + e)
for i in range(len(p)):
	if i % 2 == 1 :
		p[i-1]=o[int((i-1)/2)]
	else:
		p[i-1]=e[int((i/2)-1)]
print("".join(p))

Submission status: Wrong Answer

Solution code:
o=list(input())
e=list(input())
p=list(o + e)
for i in range(len(p)):
	if i % 2 == 1 :
		p[i-1]=o[int((i-1)/2)]
	else:
		p[i-1]=o[int((i/2)-1)]
print("".join(p))

Submission status: Wrong Answer

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(i)
print(s)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def resolve():
    o = input()
    e = input()
    print("".join([oi + ei for oi, ei in zip(o, e)]))


if __name__ == "__main__":
    resolve()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(",".join(b).replace(",", ""))

Submission status: Wrong Answer

Solution code:
from sys import stdin
# import itertools as itr

# A, B = stdin.readline().rstrip().split() # 問題文に出てくるA，B，Cが空白区切りで1行で入力される場合はアンパック代入が便利

# C = [stdin.readline().rstrip().split() for _ in range(2)] # 問題文に出てくるA，B，Cが空白区切りで1行で入力される場合はアンパック代入が便利

A = str(input())
B = str(input())

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


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

print(AL)

b = []
for i in range(BL):
  b.append(A[i] + B[i])
  if AL -BL == 1:
    b.append(A[-1])

print(",".join(b).replace(",", ""))




# transpose = [x for x in zip(*C)]
# print(C)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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 += E[-1]
print(password)

Submission status: Wrong Answer

Solution code:
O = input()
E = input()
for x,y in zip (O,E):
  print(x+y,end='')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
print("".join(sum(zip(input(), input()), tuple())))

Submission status: Wrong Answer

Solution code:
o = input()
e = input()
for i,j in zip(o,e):
    print(i,j,sep="",end="")
print()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

    for o, e in zip(odd, even):
        print(o+e, end="")
    print()

if __name__ == '__main__':
    resolve()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
from fractions import gcd
import bisect
 
stdin = sys.stdin
 
ns = lambda: stdin.readline().rstrip()
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
s = lambda h: [list(map(int, stdin.readline().split())) for i in range(h)]

o = ns()
e = ns()

for oi, ei in zip(o, e):
        print(oi + ei, end='')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

ans=[]
if len(o)==len(e):
    for i in range(len(e)):
        ans.append(o[i])
        ans.append(e[i])
else:
    ans.append(o[0])
    for i in range(len(e)):
        ans.append(o[i+1])
        ans.append(e[i])

print(''.join(ans))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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