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=input()
for i in range(len(e)):
    o.insert(2*i+1,e[i])
print(*o)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if len(a) == len(b):
    for i in range(0, len(a)):
        print(a[i] + b[i], end = "")

Submission status: Wrong Answer

Solution code:
o = list(input())
e = list(input())
for s,t in zip(o,e):
    print(s+t,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 = input()
E = input()

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

print(password)

Submission status: Wrong Answer

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

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

print("".join(lst))

Submission status: Wrong Answer

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

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 = input()
E = input()
print(*[o+e for o,e in zip(O,E)], sep="")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

print(a)

Submission status: Wrong Answer

Solution code:
o = input()
e = input()
p = ""
for o, e in zip(o, e):
  p = p + o + e
  
print(p if len(o) == len(e) else p + o[-1])

Submission status: Wrong Answer

Solution code:
o = input()
e = input()
p = ""
for o, e in zip(o, e):
  p += (o + e)
  
print(p if len(o) == len(e) else p + o[-1])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
O = input()
E = input()
s = ""
for so,se in zip(O,E):
    s += so+se
print(*s,sep="")

Submission status: Wrong Answer

Solution code:
O=input()
E=input()
lo=len(O)
le=len(E)
ans=""

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

ans = []
for o, e in zip(O,E):
    ans += o,e
print(*ans, sep='')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
o=input()
e=input()
print(''.join(['{}{}'.format(a,b) for a,b in zip(o,e)]))

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

o = input()
n = input()

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

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

Submission status: 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())
n=len(o)
m=len(e)
ans=[]
for i in range(m):
    ans.append(o[i])
    ans.append(e[i])
if n!=m:
    ans.append(o[-1])
print("".join(ans))
if "".join(ans)=="aattccooddeerrbreeggiunlnaerrccoonntteesstt":
    print("a")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

ans += max(O,E)[-1]
print(ans)

Submission status: Wrong Answer

Solution code:
O = list(input())
E = list(input())
ans =''
for a,b in zip(O,E):
    ans+=a+b
print(ans)

Submission status: Wrong Answer

Solution code:
O = input()
E = input()
print(''.join(S+T for S,T in zip(O,E)))

Submission status: Wrong Answer

Solution code:
O,E = input(),input()
ans = ''
if len(O)+len(E)%2==0:
    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=input()
E=input()

print(''.join([x+y for x,y in zip(O,E)]))

Submission status: Wrong Answer

Solution code:
oo,ee = map(list, open(0).read().split())

ans = ''
while oo or ee:
    if ee:
        ans += ee.pop()
    if oo:
        ans += oo.pop()


print(ans[::-1])

Submission status: Wrong Answer

Solution code:
#その10

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

Submission status: Wrong Answer

Solution code:
oo = input()
ee = input()

ans = ''
for i in range(len(oo)):
    ans += oo[i]
    if i < len(ee):
        ee += ee[i]
print(ans)

Submission status: Wrong Answer

Solution code:
oo = input()
ee = input()

for i in range(len(oo)):
    print(oo[i])
    if i < len(ee):
        print(ee[i])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

x = [o+e for o,e in zip(O,E)]
print(''.join(x))

Submission status: Wrong Answer

Solution code:
e = list(input())
t = list(input())
password = ""
for odd, even in zip(e, t):
    password += odd + even
print(password)

Submission status: Wrong Answer

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

for o, e in zip(O, E):
    a.append(o)
    a.append(e)
print(''.join(a))

Submission status: Wrong Answer

Solution code:
O = input()
E = input()
num = 0
num_2 = 0
pw = ""
for i in list(O):
  if num % 2 == 0:
    pw+=i
    num+=1
  else:
    pw+=E[num_2]
    num+=1
    num_2+=1
print(pw)

Submission status: Wrong Answer

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

N=len(O)
M=len(E)
ans=""
for i in range(N):
    ans+=O[i]
    if N-M==1 and i==M-1:
        break
    ans+=E[i]
print(ans)

Submission status: Wrong Answer

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

a_len = len(a)
b_len = len(b)

huku = []

for i in range(a_len):
    if a_len != b_len & i==a_len-1:
        break
    else:
        huku.append(a[i])
        huku.append(b[i])
for i in range(len(huku)):
    print(huku[i],end="")

Submission status: Wrong Answer

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

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

print(ans)

Submission status: Wrong Answer

Solution code:
o = list(str(input()))
x = list(str(input()))
ln = []
for i in o:
    for j in x:
        ln.append(i)
        ln.append(j)
print(''.join(ln))

Submission status: Wrong Answer

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

ans = ''.join(''.join(s) for s in zip(O, E))
ans += E[-1] if len(O) - len(E) == 1 else ''
print(ans)

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:
def main():
  o = input()
  e = input()
  s=""
  for i in range(0,len(e)):
    s =s+o[i]+e[i]
  if len(o)>len(o):
    s += o[len(o)-1]
  print(s)
main()

Submission status: Wrong Answer

Solution code:
word=[input() for i in range(2)];print(''.join([i[0]+i[1] for i in zip(word[0],word[1])]))

Submission status: Wrong Answer

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

def main():
    O = input()
    E = input()
    s = ['x']*(len(O) + len(E))
    for i in range(len(O)//2):
        s[i*2] = O[i]
        s[i*2+1] = E[i]
    if len(O) % 2:
        s[-1] = O[-1]
    print(''.join(s))


if __name__ == '__main__':
    main()

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()
P = ''
for i in range(min(len(O),len(E))) :
    P = P + O[i]
    P = P + E[i]
print(P)

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

K = len(E)

String = ""

for i in range(K):
    
    String += O[i]
    String += E[i]

print(String)

Submission status: Wrong Answer

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




array = []
ans = ''
for i in range(1,len(O)+len(E)+1):
    if(i % 2 != 0):
        array.append(O.pop())
    else:
        array.append(E.pop())
array = list(reversed(array))
for j in array:
    ans += j

print(ans)

Submission status: Wrong Answer

Solution code:
import math
from collections import deque
from collections import defaultdict
import itertools as it

#自作関数群
def readInt():
	return int(input())
def readInts():
	return list(map(int, input().split()))
def readChar():
	return input()
def readChars():
	return input().split()
def factorization(n):
	res = []
	if n%2==0:
		res.append(2)
	for i in range(3,math.floor(n//2)+1,2):
		if n%i==0:
			c = 0
			for j in res:
				if i%j==0:
					c=1
			if c==0:
				res.append(i)
	return res
def fact2(n):
	p = factorization(n)
	res = []
	for i in p:
		c=0
		z=n
		while 1:
			if z%i==0:
				c+=1
				z/=i
			else:
				break
		res.append([i,c])
	return res
def fact(n):#階乗
	ans = 1
	m=n
	for _i in range(n-1):
		ans*=m
		m-=1
	return ans
def comb(n,r):#コンビネーション
	if n<r:
		return 0
	l = min(r,n-r)
	m=n
	u=1
	for _i in range(l):
		u*=m
		m-=1
	return u//fact(l)
def combmod(n,r,mod):
	return (fact(n)/fact(n-r)*pow(fact(r),mod-2,mod))%mod
def printQueue(q):
	r=copyQueue(q)
	ans=[0]*r.qsize()
	for i in range(r.qsize()-1,-1,-1):
		ans[i] = r.get()
	print(ans)
class UnionFind():
	def __init__(self, n):
		self.n = n
		self.parents = [-1]*n

	def find(self, x): # root
		if self.parents[x]<0:
			return x
		else:
			self.parents[x] = self.find(self.parents[x])
			return self.parents[x]

	def union(self,x,y):
		x = self.find(x)
		y = self.find(y)

		if x==y:
			return

		if self.parents[x]>self.parents[y]:
			x,y = y,x

		self.parents[x]+=self.parents[y]
		self.parents[y]=x

	def size(self,x):
		return -1*self.parents[self.find(x)]

	def same(self,x,y):
		return self.find(x)==self.find(y)

	def members(self,x): # much time
		root = self.find(x)
		return [i for i in range(self.n) if self.find(i)==root]

	def roots(self):
		return [i for i,x in enumerate(self.parents) if x<0]

	def group_count(self):
		return len(self.roots())

	def all_group_members(self):
		return {r: self.members(r) for r in self.roots()} # 1~n
def bitArr(n):#ビット全探索
	x = 1
	zero = "0"*n
	ans = []
	ans.append([0]*n)
	for i in range(2**n-1):
		ans.append(list(map(lambda x:int(x),list((zero+bin(x)[2:])[-1*n:]))))
		x+=1
	return ans;
def arrsSum(a1,a2):
	for i in range(len(a1)):
		a1[i]+=a2[i]
	return a1
def maxValue(a,b,v):
	v2 = v
	for i in range(v2,-1,-1):
		for j in range(v2//a+1): #j:aの個数
			k = i-a*j
			if k%b==0:
				return i
	return -1
def copyQueue(q):
	nq = queue.Queue()
	n = q.qsize()
	for i in range(n):
		x = q.get()
		q.put(x)
		nq.put(x)
	return nq
def get_sieve_of_eratosthenes(n):
	#data = [2]
	data = [0,0,0]
	for i in range(3,n+1,2):
		data.append(i)
		data.append(0)
	for i in range(len(data)):
		interval = data[i]
		if interval!=0:
			for j in range(i+interval,n-1,interval):
				data[j] = 0
	#ans = [x for x in data if x!=0]
	ans = data[:]
	return ans

o = readChar()
e = readChar()

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

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

Submission status: Wrong Answer

Solution code:
import math
from collections import deque
from collections import defaultdict
import itertools as it

#自作関数群
def readInt():
	return int(input())
def readInts():
	return list(map(int, input().split()))
def readChar():
	return input()
def readChars():
	return input().split()
def factorization(n):
	res = []
	if n%2==0:
		res.append(2)
	for i in range(3,math.floor(n//2)+1,2):
		if n%i==0:
			c = 0
			for j in res:
				if i%j==0:
					c=1
			if c==0:
				res.append(i)
	return res
def fact2(n):
	p = factorization(n)
	res = []
	for i in p:
		c=0
		z=n
		while 1:
			if z%i==0:
				c+=1
				z/=i
			else:
				break
		res.append([i,c])
	return res
def fact(n):#階乗
	ans = 1
	m=n
	for _i in range(n-1):
		ans*=m
		m-=1
	return ans
def comb(n,r):#コンビネーション
	if n<r:
		return 0
	l = min(r,n-r)
	m=n
	u=1
	for _i in range(l):
		u*=m
		m-=1
	return u//fact(l)
def combmod(n,r,mod):
	return (fact(n)/fact(n-r)*pow(fact(r),mod-2,mod))%mod
def printQueue(q):
	r=copyQueue(q)
	ans=[0]*r.qsize()
	for i in range(r.qsize()-1,-1,-1):
		ans[i] = r.get()
	print(ans)
class UnionFind():
	def __init__(self, n):
		self.n = n
		self.parents = [-1]*n

	def find(self, x): # root
		if self.parents[x]<0:
			return x
		else:
			self.parents[x] = self.find(self.parents[x])
			return self.parents[x]

	def union(self,x,y):
		x = self.find(x)
		y = self.find(y)

		if x==y:
			return

		if self.parents[x]>self.parents[y]:
			x,y = y,x

		self.parents[x]+=self.parents[y]
		self.parents[y]=x

	def size(self,x):
		return -1*self.parents[self.find(x)]

	def same(self,x,y):
		return self.find(x)==self.find(y)

	def members(self,x): # much time
		root = self.find(x)
		return [i for i in range(self.n) if self.find(i)==root]

	def roots(self):
		return [i for i,x in enumerate(self.parents) if x<0]

	def group_count(self):
		return len(self.roots())

	def all_group_members(self):
		return {r: self.members(r) for r in self.roots()} # 1~n
def bitArr(n):#ビット全探索
	x = 1
	zero = "0"*n
	ans = []
	ans.append([0]*n)
	for i in range(2**n-1):
		ans.append(list(map(lambda x:int(x),list((zero+bin(x)[2:])[-1*n:]))))
		x+=1
	return ans;
def arrsSum(a1,a2):
	for i in range(len(a1)):
		a1[i]+=a2[i]
	return a1
def maxValue(a,b,v):
	v2 = v
	for i in range(v2,-1,-1):
		for j in range(v2//a+1): #j:aの個数
			k = i-a*j
			if k%b==0:
				return i
	return -1
def copyQueue(q):
	nq = queue.Queue()
	n = q.qsize()
	for i in range(n):
		x = q.get()
		q.put(x)
		nq.put(x)
	return nq
def get_sieve_of_eratosthenes(n):
	#data = [2]
	data = [0,0,0]
	for i in range(3,n+1,2):
		data.append(i)
		data.append(0)
	for i in range(len(data)):
		interval = data[i]
		if interval!=0:
			for j in range(i+interval,n-1,interval):
				data[j] = 0
	#ans = [x for x in data if x!=0]
	ans = data[:]
	return ans

o = readChar()
e = readChar()

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

if len(o)!=len(e):
	print(e[-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:
o = input()
e = input()
s = ''
for i, j in zip(o, e):
    s = s+i+j
print(s)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
o = input()
e = input()+""
 
for s, t in zip(o, e):
  print(s, t, sep='', end='')

Submission status: Wrong Answer

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

for s, t in zip(o, e):
  print(s, t, sep='', end='')

Submission status: Wrong Answer

Solution code:
def joinstring(O, E) : 
  str = "".join([i + j for i, j in zip(O, E)])
  return str


O = input()
E = input()

print(joinstring(O, E))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(ans)

Submission status: Wrong Answer

Solution code:
O = input()
#atcoderbeginnercontest

E = input()
#atcoderregularcontest
S = []

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

print("".join(S))

Submission status: Wrong Answer

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

print(*[x + y for x,y in zip(O,E)],sep='')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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:
# coding: utf-8
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() + ""
print("".join(o + e for o, e in zip(O, E)))

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

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

print(ans)

Submission status: Wrong Answer

Solution code:
A = input()
B = input()
C = []
for i in range(len(A)+len(B)):
    if i % 2 == 0:
        C.append(A[int(i/2)])
    else:
        C.append(B[int(i/2)])
print(*C)

Submission status: Wrong Answer

Solution code:
A = input()
B = input()
for i in range(len(A)+len(B)):
  print(A[int(i/2)], end = "" if i % 2 ==0 else B[int(i/2)])

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:
O =input()
E = input()
for a,b in zip(O,E):
    print(a+b, 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 = list(input())
E = list(input())

ans = []

for i in range(len(E)):
    ans.append(O[i])
    ans.append(E[i])

if len(O) > len(E):
    ans.append(O[-1])
print(ans)

Submission status: Wrong Answer

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

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

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()
E = input()
for o, e in zip(O,E): print(o+e, end="")

Submission status: Wrong Answer

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

for o, i in zip(O, I): print(o+i, end="")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
o=input()
e=input()
moji=""
for i in range(0,len(o)):
  try:
    moji+=o[i]+e[i]
  except IndexError:
    pass
print(moji)

Submission status: Wrong Answer

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

ans = ""
for q in range(min(len(o), len(e))):
    ans += o[q] + e[q]
if len(o) != len(e):
    ans += e[-1]
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
O = input()
E = input()
N = len(O)+len(E)
p = ""
for i in range(N//2):
    p += O[i] + E[i]
    if N % 2 ==1:
        p += O[i+1]
print(p)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

if len(o)==len(e):
    for i in range(2*len(o)-1):
        if i%2==0:
            ans.append(o[i//2])
        else:
            ans.append(e[i//2])

else:
    for i in range(2*len(e)-3):
        if i%2==0:
            ans.append(o[i//2])
        else:
            ans.append(e[i//2])
    ans.append(o[-1])

print(ans)

Submission status: Wrong Answer

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

print(*ans, 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())
p=[]
for a in range(len(o)-1):
    p.append(o.pop(0))
    p.append(e.pop(0))
if len(o):
    p.append(o.pop(0))
print("".join(p))

Submission status: Wrong Answer

Solution code:
o=input()
e=input()
i=0
ans=""
while i<len(e):
  ans+=o[i]+e[i]
  i+=1
print(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())
for x,y in zip(O,E):
    print(x+y,end="")

Submission status: Wrong Answer

Solution code:
O = input()
E = input()
n = 0
i = len(O) - 1
while(n <= i):
  print(O[n],end = "")
  if(n == i):
    pass
  else:
    print(E[n],end = "")
  n += 1

Submission status: Wrong Answer

Solution code:
s = input()
t = input()
ans = "".join([s[i] + t[i] for i in range(len(t))])
print(ans + s[-1]) if len(s) - len(s) == 1 else print(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:
# ABC 058: B – ∵∴∵
o, e = [input() for _ in range(2)]
passwd = ''.join([o[i] + e[i] for i in range(len(e))])
print(passwd if len(o) == len(passwd) else passwd + o[-1])

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:
n=2
string_list=[input() for i in range(n)]

a = string_list[0]
b = string_list[1]

def big(a,b):
    if a > b:
        return a
    else:
        return b

def plus(a,b):
    c = a[i]
    d = b[i]
    return c+d

e = ""
for i in range(len(big(a,b))):
    e += plus(a,b)

print(e)

Submission status: Wrong Answer

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

def big(a,b):
    if a > b:
        return a
    else:
        return b

def plus(a,b):
    c = a[i]
    d = b[i]
    return c+d

e = ""
for i in range(len(big(a,b))):
    e += plus(a,b)

print(e)

Submission status: Wrong Answer

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

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

if len(O) > len(E):
    ans.append(E[-1])

print("".join(ans))

Submission status: Wrong Answer

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


if __name__ == '__main__':
    main()

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 O>E:
    print(O[-1])

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:
ans=''
a, b = (input() for _ in range(2))

for i, j in zip(a, b):
    ans += i + j
print(ans)

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 = input()
E = input()
for o, e in zip(O, E):
    print(o,e, sep='', end='')
if abs(len(O) - len(E)) == 1:
    if abs(len(O) - len(E)) > 1:
        print(O[-1])
    elif abs(len(O) - len(E)) < 1:
        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='')
if abs(len(O) - len(E)) > 1:
    print(O[-1])
elif abs(len(O) - len(E)) < 1:
    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:
O = input()
E = input()
for o, e in zip(O, E):
    print(o,e, sep='', end='')