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

Solution (Python):
import sys
a = []
b = []
a = input()
b = input()

for num in range(0,len(a)):
   sys.stdout.write(a[num])
   if len(b) > num:
       sys.stdout.write(b[num])

Solution (Python):
O,E=[list(input().rstrip()) for _ in range(2)]
for i in range(len(E)):
    O.insert(2*i+1,E[i])
print(*O,sep="")

Solution (Python):



import sys
import re
import math
import collections
import itertools
import functools

DEBUG = True
DEBUG = False

def dbg(*args):
    if DEBUG:
        print("DBG: ", file=sys.stderr, end="")
        print(*args, file=sys.stderr)



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

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

if __name__ == "__main__": main()

Solution (Python):
O = str(input())
E = str(input())
pw = ""

for i in range(0, len(O)):
    str = (O + E)[i::len(O)]
    pw += str

print(pw)

Solution (Python):
o = input()
lio = list(o)
e = list(input())
ans = ""

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

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

r = ""
for i in range(len(s)+len(t)):
  if i%2==0:
    r += s[i//2]
  else:
    r += t[i//2]

print(r)

Solution (Python):


O = input()
E = input()
E+=" "
s=""
for i in range(len(O)):
    s+= (O[i]+E[i])
s.split()
print(s)

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

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

Solution (Python):
from collections import defaultdict
from itertools import zip_longest


def main():
    O = input()
    E = input()
    ans = ""
    for o, e in zip_longest(O, E, fillvalue=""):
        ans += o + e
    print(ans)


if __name__ == '__main__':
    main()

Solution (Python):
O=str(input())
E=str(input())
m=max(len(O),len(E))
for i in range(m):
 if (i<len(O)):
  print (O[i], end="")
 if (i<len(E)):
  print(E[i], end="")

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


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

Solution (Python):
O=list(str(input()))
E=list(str(input()))
p=[]
for i in range(1,len(O)+len(E)+1):
    if i%2==1:
        p.append(O[(i-1)//2])
    else:
        p.append(E[(i-2)//2])
print("".join(p))

Solution (Python):


import sys
import subprocess
import json
import time
import math
import re
import sqlite3

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

print(res)

Solution (Python):
import sys




def read_int_list():
    return list(map(int, input().split()))


def read_str_list():
    return input().split()


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


def read_str():
    return input()


o = read_str()
e = read_str()
if len(e) < len(o):
    e = e + ' '
l = []
for i, j in zip(o, e):
    l.append(i)
    l.append(j)
res = ''.join(l)
print(res)

Solution (Python):
if __name__ == "__main__":
    O = input()
    E = input()

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

    if len(O) > len(E):
        print(result + O[-1])
    else:
        print(result)

Solution (Python):

s1 = input()
s2 = input()

ret = ""
l1 = len(s1)
l2 = len(s2)

for i, j in zip(s1, s2):
    ret += i+j

if l1 < l2:
    ret += s2[-1]
elif l1 > l2:
    ret += s1[-1]

print(ret)

Solution (Python):
def solve():
    a=str(input())
    b=str(input())
    for i in range(len(b)):
        print(a[i]+b[i],end='')
    if(len(a)>len(b)):
        print(a[len(a)-1],end='')
    print()

if __name__ == "__main__":
    solve()

Solution (Python):
import itertools

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

print("".join(itertools.chain(*zip(O, E))) + (O[-1] if len(O) is not len(E) else ""))

Solution (Python):
O = str(input())
E = str(input())

ma = max(len(O), len(E))

for i in range(ma):
    if (i < len(O)):
        print(O[i], end="")
    if (i < len(E)):
        print(E[i], end="")

Solution (Python):
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 (o[len(o)-1], end='')
    print()

Solution (Python):


import os
import sys

class Main(object):

    def __init__(self):
        pass

    def some_method(self):
        o = input()
        e = input()
        ans = ''
        length = max(len(o), len(e))
        for i in range(length):
            if i < len(o):
                ans += o[i]
            if i < len(e):
                ans += e[i]
        print(ans)
                         
                

        return None

if __name__ == '__main__':
    m = Main()
    m.some_method()

Solution (Python):
if __name__ == "__main__":
    X = input()
    Y = input()
    N = len(X) + len(Y)
    res = ""
    cnt1 = 0
    cnt2 = 0
    for x in range(N):
        if (x % 2 == 0):
            res += X[cnt1]
            cnt1 += 1
        else:
            res += Y[cnt2]
            cnt2 += 1
    print (res)

Solution (Python):
O = [i for i in input()]
E = [i for i in input()]
psw = ''

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

if len(O) > len(E):
    psw += O[-1]


print(psw)

Solution (Python):
from itertools import zip_longest
print("".join([x+y for x, y in zip_longest(input(), input(), fillvalue="")]))

Solution (Python):
o = input()
e = input()
ret = ""
for i in range(len(o) + len(e)):
    if i % 2 == 0:
        ret += o[i//2]
    else:
        ret += e[i//2]
print(ret)

Solution (Python):
A = str(input())
B = str(input())
C = [A[i]+B[i] for i in range(len(B))]

if len(A) > len(B):
    C.append(A[-1])
else:
    pass

C_str = "".join(C)

print(C_str)

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

print("".join([O[i] + E[i] if i < len(E) else O[i] for i in range(len(O))]))

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

password = O[0] + E[0]

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

print(password)

Solution (Python):


o = raw_input()
e = raw_input()
passwd = ""

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

print passwd

Solution (Python):


A=input()
B=input()
ans=str()
if len(A)==len(B):
  for i in range (0,len(A)):
    ans+=A[i]+B[i]
else:
  for i in range (0,len(A)-1):
    ans+=A[i]+B[i]
  ans+=A[-1]
print(ans)

Solution (Python):
A=input()
B=input()
s=''
for i in range(len(A)):
  s += A[i]
  if i < len(B):
    s += B[i]
print(s)

Solution (Python):
a = input()
b = input()
n = len(a)
limit = len(b)
for i in range(n):
    print(a[i], end = '')
    if i < limit:
        print(b[i], end = '')

Solution (Python):
o, e = [input().rstrip() for i in range(2)] 
ans = ""
for i in range(len(o)):
  ans += o[i]
  if len(e) > i: ans += e[i]
print(ans)

Solution (Python):
O=str(input())
E=str(input())
passwords=str()

if len(O)==len(E):
    for i in range(0,len(O)):
        passwords=passwords+O[i]
        passwords=passwords+E[i]
elif len(O)>len(E):
    for i in range(0,len(E)):
        passwords=passwords+O[i]
        passwords=passwords+E[i]
    passwords=passwords+O[-1]
else:
    for i in range(0,len(O)):
        passwords=passwords+O[i]
        passwords=passwords+E[i]
    passwords=passwords+E[-1]
    
print(passwords)

Solution (Python):
O, E = raw_input(), raw_input()
print "".join([(O[i/2] if (i % 2 == 0) else E[i/2]) for i in range(len(O+E))])

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

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

Solution (Python):
import sys
read=lambda:sys.stdin.readline().rstrip()
readi=lambda:int(sys.stdin.readline())
writeln=lambda x:sys.stdout.write(str(x)+"\n")
write=lambda x:sys.stdout.write(x)
a=read();b=read();la,lb=len(a),len(b);r=[]
for i in range(lb):
    r.append(a[i]);r.append(b[i])
if la != lb:
    r.append(a[-1])
print(''.join(r))

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

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

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

ans = ""
for i in range(len(a)):
  ans += a[i]
  if(i != len(a) - 1):
    ans += b[i]
  else:
    if(len(a) == len(b)):
      ans += b[i]

print(ans)

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

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

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

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

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

if len(a) == len(b):
    for i in range(0,len(a)):
        print(a[i]+b[i],end='')
else:
    for i in range(0,len(a) - 1):
        print(a[i] + b[i],end='')
    print(a[len(a) - 1])

Solution (Python):
print((lambda O, E, f: f('', list(O + E[::-1]), f))(input(), input(), lambda a, q, f: f(a + q[0], list(reversed(q[1:])), f) if q else a))

Solution (Python):



O = input()
E = input()
if len(O) > len(E):
    E = E + ' '
password = [''.join((O[i], E[i])) for i in range(len(O))]
print(''.join(password).replace(' ', ''))

Solution (Python):
kis = input()
gus = input()
a = len(kis)
b = len(gus)
c = ""
if a == b:
 for i in range(a) :
  c += kis[i] + gus[i]
else:
  for i in range(b): 
   c += kis[i] + gus[i]
  c += kis[a-1]

print(c)

Solution (Python):
O = list(input())
E = list(input())
s = ''
while O or E:
    if len(E) >= len(O):
        s = E.pop() + s
    else:
        s = O.pop() + s
print(s)

Solution (Python):
O = list(input())
E = list(input())
s = ''
while O or E:
    if len(E) >= len(O):
        s = E.pop() + s
    else:
        s = O.pop() + s
print(s)

Solution (Python):
s = input();
t = input();

n = len(s);
for i in range(n) :
	print(s[i], end="");
	if i < len(t) :
		print(t[i], end="");
print("");

Solution (Python):
import sys

def solve():
    O = input()
    E = input() + '

    ans = [c1 + c2 for c1, c2 in zip(O, E)]
    ans = ''.join(ans).rstrip('

    print(ans)

if __name__ == '__main__':
    solve()

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

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

if len(O) - len(E) == 1:
    ans = '%s%s' % (ans, O[-1])

print ans

Solution (Python):
print(''.join([a + b for a, b in zip(input(), input()+'\n')]).split('\n')[0])

Solution (Python):
O=input()
E=input()
a=int(len(O))
b=int(len(E))
s=str()
for i in range(b):
    s += O[i]
    s += E[i]
if a>b:
    s += O[a-1]

print(s)

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

tmp1 = len(a)
tmp2 = len(b)

s = ''

if tmp1 > tmp2:
    for i in range(tmp1):
        if i+1 == tmp1:
            s += a[i]
        else:
            s += a[i]
            s += b[i]
else:
    for i in range(tmp2):
            s += a[i]
            s += b[i]

print(s)

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

Solution (Python):
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(e)],end='')
print()

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

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

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

print(S)

Solution (Python):
o = input()
e = input()
password = ''
for i in range(len(e)):
    password += o[i] + e[i]
if len(o) != len(e):
    password += o[-1]
print(password)

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

Solution (Python):
import itertools
O = raw_input()
E = raw_input()
seq = []
for x, y in itertools.izip_longest(O, E):
    if x: seq.append(x)
    if y: seq.append(y)
print ''.join(seq)

Solution (Python):
a = input()
b = input()
r = ''
for i in range(len(a)):
  r+=a[i]
  if i < len(b):
    r+=b[i]
print(r)

Solution (Python):
a=raw_input()
b=raw_input()

out=""

for i in range(len(b)):
    out+=a[i]
    out+=b[i]
if len(a)>len(b):
    out+=a[-1]

print out

Solution (Python):
def S():
	return input()
o = S()
e = S()
ol = len(o)
el = len(e)
r = ''
for i in range(ol):
	r += o[i]
	if i < el:
		r += e[i]
print(r)

Solution (Python):
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)

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

Solution (Python):

O = input()
E = input() + " "

L = len(O)
TMP = ""

for i in range(L):
    TMP = TMP+O[i]+E[i]

print(TMP.strip())

Solution (Python):
import sys
import numpy as np

I = input()
J = input()
E = list(I)
O = list(J)

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

print(password)

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


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

    str = str + i+j

if(len(O) > len(E)): str += O[len(O)-1]

print(str)

Solution (Python):


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

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

Solution (Python):

x = input()
y = input()

final = ""

for i in range(len(x)):
	final += x[i]
	if i < len(y):
		final += y[i]

if len(y) > len(x):
	diff = len(y) - len(x)
	final += y[diff::]

print(final)

Solution (Python):
a=raw_input()
b=raw_input()
l=''
for i in range(len(a)):
    l+=a[i]
    if i<len(b):
        l+=b[i]
print l

Solution (Python):
o=list(input())
e=list(input())
p=""
for i in range(len(e)):
    p+=o[i]
    p+=e[i]
if len(o)-i==2:
    p+=o[i+1]
print(p)

Solution (Python):
o = input()
e = input()
r = ''

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

Solution (Python):
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]

if len(ostr) > num:
    ans += ostr[num]

print(ans)

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

Solution (Python):
a = raw_input()
b = raw_input()
ans = ""
for i in xrange(len(a)):
    ans += a[i]
    if i < len(b):
       ans += b[i]
print ans

Solution (Python):
print(*(x+y for x,y in zip(input(),input()+' ')),sep='')

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

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

print(s)

Solution (Python):
ls = [raw_input() for _ in range(2)]
s = ''
for i in range(len(ls[0])+len(ls[1])):
    s += ls[i%2][i/2]
print s

Solution (Python):
O=input()
E=input()
ans=""
a=len(O)

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

ans+=O[-1]

if a==len(E):
    ans+=E[-1]


print(ans)

Solution (Python):
o = raw_input()
e = raw_input()
password = ''

j, k = 0, 0
for i in range(len(o)+len(e)):
	if i % 2 == 0:
		password += o[j]
		j += 1
	if i % 2 == 1:
		password += e[k]
		k += 1

print password

Solution (Python):
O=str(input())
E=str(input())
n=len(O)
m=len(E)
ans=''
for i in range(n):
    ans += O[i]
    if i < m:
        ans += E[i]

print(ans)

Solution (Python):
o = input()
e = input()
for oo,ee in zip(o, e):
    print(oo+ee, end="")
if len(o) > len(e):
    print(o[-1], end="")

Solution (Python):
o = str(input())
e = str(input())
print("".join(i + j for i, j in zip(o, e + " ")).rstrip())

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

Solution (Python):
o = raw_input().strip()
e = raw_input().strip()
word = ""
for i in range(0, len(e)):
    word += o[i]
    word += e[i]
if len(o) - len(e) == 1:
    word += o[len(o) - 1]
print word

Solution (Python):
s = input()
t = input()
for i in range(0, len(s)+len(t)):
	print((t[i//2] if i&1 else s[i//2]), end="")
print("")

Solution (Python):
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))
print(abc_057_2(s_vec1,s_vec2))

Solution (Python):
o = input()
e = input()
a = list(zip(range(0,len(o) * 2,2), list(o)))
b = list(zip(range(1,len(e) * 2,2),list(e)))
print(''.join(map(lambda x: x[1], sorted(a + b))))

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

Solution (Python):
a=list(input())
b=list(input())
c=[t[0]+t[1] for t in list(zip(a, b))]
if len(a) > len(b):
    c.append(a[-1])
print(''.join(c))

Solution (Python):
O = raw_input()
E = raw_input()
ans = ""
for o, e in zip(O, E):
    ans += o
    ans += e
if len(O) != len(E):
    ans += O[-1]
print ans

Solution (Python):
O = raw_input()
E = raw_input()
ans = ""

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

ans += O[len(O)-1]

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

print ans

Solution (Python):


o=raw_input()
e=raw_input()
s=""
for i in xrange(len(e)):
 s=s+o[i]
 s=s+e[i]
if len(o)>len(e):
 s=s+o[-1]
print s

Solution (Python):
from itertools import zip_longest

odd_line = input()
even_line = input()

res = ""
for o, e in zip_longest(odd_line, even_line, fillvalue=""):

    res += (o + e)

print(res)

Solution (Python):
odds = input()
evens = input()

result = ""
while (not(len(odds) == 0 and len(evens) == 0)):
   if (len(odds) != 0):
      result += odds[0]
      odds = odds[1:]
   if (len(evens) != 0):
      result += evens[0]
      evens = evens[1:]

print(result)

Solution (Python):
O = input()
E = input()
password = ""

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

print(password)

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

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

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

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

ans = ''
for i in range(len(e)):
    ans = ans+o[i]+e[i]

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

print(ans)

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

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

print()

Solution (Python):

O = raw_input()
E = raw_input()

ans = [""]*(len(O) + len(E))
for i, o in enumerate(O):
    ans[2*i] = o
for i, e in enumerate(E):
    ans[2*i + 1] = e
print "".join(ans)

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

L=[]

if len(O)>len(E):
    for i in range(len(E)): 
        L.append(O[i])
        L.append(E[i])
        
    L.append(O[i+1])
        
else:
    for i in range(len(E)): 
        L.append(O[i])
        L.append(E[i])

print("".join(L))

Solution (Python):
O = input()
E = input()
p = ""
for i in range(len(O)):
    p += O[i]
    if(i < len(E)):
        p += E[i]
print(p)

Solution (Python):
o = input()
e = input()
if(len(o)>len(e)): e+=' '
print("".join([ch1 + ch2 for ch1 , ch2 in zip(o,e)]))

Solution (Python):
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(a)!=l:
 ans += a[-1]
print ans

Solution (Python):
O = raw_input()
E = 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]
out = ''.join(out)
print out

Solution (Python):
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)

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

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

if len(e)<len(o):
        print(o[len(o)-1])

print("")

Solution (Python):
O = list(input())
E = list(input())
leng =  len(O) + len(E)
passwd = ""

for i in range(0, leng):
  if i % 2 == 1:
    j = int( (i - 1)/2 )
    passwd += E[j]
  else:
    j = int( i / 2 )
    passwd += O[j]

print(passwd)

Solution (Python):
a, b = input(), input()
s = ''
for i in range(len(a)):
    s += a[i]
    if i < len(b): s += b[i]
print(s)

Solution (Python):
O=raw_input()
E=raw_input()
moji=''
Olength = len(O)
Elength = len(E)
for i in range(Olength):
 moji = moji + O[i]
 if i < Elength:
  moji = moji +E[i]
print moji

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

ans = ""
for i in range(len(e)):
    ans += o.pop(0)
    ans += e.pop(0)
else:
    if o:
        ans += o.pop(0)

print(ans)

Solution (Python):


pswd=[[],[]]
pswd[0]=input()
pswd[1]=input()

mozilen=len(pswd[0])+len(pswd[1])

ans=''
for idx in range(0,mozilen,1):
    ans=ans+pswd[idx%2][idx//2]

print(ans)

Solution (Python):



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

i = 0

while i < max(len(o),len(e)):
    if(i<len(o)):
        print(o[i],end="")
    if(i<len(e)):
        print(e[i],end="")
    i += 1

Solution (Python):
od = input()
ev = input().ljust(len(od), '0')

pw = ''
for i, j in zip(od, ev):
	pw += i+j

if pw[-1] == '0':
	pw = pw[0:-1]

print(pw)

Solution (Python):
a = raw_input()
b = raw_input()

print ''.join([x+y for x,y in zip(a,b)]) + (
  a[-1] if len(a) > len(b) else b[-1] if len(b) > len(a) else ''
)

Solution (Python):
o = raw_input()
e = raw_input()
o = list(o)
e = list(e)
password = []
if len(e) == len(o):
    for i in range(len(e)):
        password.append(o[i])
        password.append(e[i])
else:
    for i in range(len(e)):
        password.append(o[i])
        password.append(e[i])
    password.append(o[len(o)-1])
print ''.join(password)

Solution (Python):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time

sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()


def main():
    o = S()
    e = S()
    l = len(o)
    el = len(e)
    r = ''
    for i in range(l):
        r += o[i]
        if i < el:
            r += e[i]
    return r



print(main())

Solution (Python):


O = raw_input()
E = raw_input()

if len(O) > len(E):
    E += " "

passwd = ""

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

passwd = passwd.replace(" ", "")
print passwd

Solution (Python):
o = list(input())
e = list(input())
ans = ""

olen = len(o)
num = olen - len(e)
if num==0:
    for n in range(olen):
        ans += o[n] + e[n]
else:
    for n in range(len(e)):
        ans += o[n] + e[n]
    ans += o[olen-1]
print(ans)

Solution (Python):

O = input()
E = input()
x = []
for i in range(len(E)):
    x.append(O[i]+E[i])
if len(O) > len(E):
    x.append(O[-1])
print("".join(x))

Solution (Python):
def main():
    O = list(input())
    E = list(input())

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

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

main()

Solution (Python):


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)

Solution (Python):
import sys

x = sys.stdin.readline().strip()
y = sys.stdin.readline().strip()

result = ""
n = len(y)
for i in range(0,n):
	result = result + x[i] + y[i]

if len(x)>n:
	result = result + x[-1]

print(result)

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

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

pas = [a+b for a,b in zip(O,E)]
if len(O)-len(E)==1:
    pas += O[-1]
a = ""

for i in pas:
    a = a + i
print(a)

Solution (Python):

O, E = (list(input()),list(input()))
O.reverse()
E.reverse()
factor = len(O)+len(E)
num = 1
ans = []
while factor > 0:
    if num%2 != 0:
        tmp = O.pop()
    else:
        tmp = E.pop()
    ans.append(tmp)
    num += 1
    factor -= 1
ans = ''.join(ans)
print(ans)

Solution (Python):
o = list(input())
e = list(input())
j = 0
k = 0
ans = ""
for i in range(0, len(o) + len(e)):
    if i%2 == 0:
        ans += o[j]
        j += 1
    else:
        ans += e[k]
        k += 1
print(ans)

Solution (Python):
O=input()
E=input()
o=len(O)
e=len(E)

P=O[0]+E[0]
i = 1
if o > e:
	while i < o-1:
		P+=O[i]+E[i]
		i+=1
	P=P+O[o-1]
	print(P)
else:
	while i < e-1:
		P+=O[i]+E[i]
		i+=1
	P=P+O[e-1]+E[e-1]
	print(P)

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

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

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

if len(O) > len(E):
    ans += O[-1]

print (ans)

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

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

Solution (Python):



o = list(str(raw_input()))  
e = list(str(raw_input()))  
out=[]





if len(o)>len(e):
    for i in range(len(e)):
        
        
        
        
        
        out.append(o[i])
        out.append(e[i])
    out.append(o[-1])
        
else:
    for i in range(len(e)):
        out.append(o[i])
        out.append(e[i])
        





print "".join(out)

Solution (Python):
from __future__ import division
import io, sys, atexit, os, itertools
sys.stdout = io.BytesIO()
atexit.register(lambda: sys.__stdout__.write(sys.stdout.getvalue()))
sys.stdin = io.BytesIO(sys.stdin.read())
raw_input = lambda: sys.stdin.readline().rstrip()
 
o = raw_input()
e = raw_input()
l = list()
j = k = 0
for i in range(len(o)+len(e)):
	if i%2:
		l.append(e[k])
		k += 1
	else:
		l.append(o[j])
		j += 1

print(''.join(l))

Solution (Python):

O = raw_input()
E = raw_input()

p = ""

if (len(O)+len(E)) % 2 == 0:
    for i in xrange(len(O)):
        p += O[i]
        p += E[i]
else:
    for i in xrange(len(O)-1):
        p += O[i]
        p += E[i]
    p += O[len(O)-1]

print(p)

Solution (Python):
a = input()
b = input()
c = ""

for i in range(len(a)):
    if len(b) >= i+1:
        d = a[i] + b[i]
        c += d
    else:
        c += a[i]
        break

print(c)

Solution (Python):
odd_strs = input()
even_strs = input()
length = len(odd_strs)

password = ""
for i in range(length):
    password += odd_strs[i]
    if i < len(even_strs):
        password += even_strs[i]

print(password)

Solution (Python):


O=list(raw_input())
E=list(raw_input())

length=len(O)+len(E)
word=['']*length

for i in range(length):
    if i%2==0:
        word[i]=O.pop(0)
    else:
        word[i]=E.pop(0)

ans=''.join(word)
print ans

Solution (Python):
odds = input()
evens = input()

result = ""
while (not(len(odds) == 0 and len(evens) == 0)):
   if (len(odds) != 0):
      result += odds[0]
      odds = odds[1:]
   if (len(evens) != 0):
      result += evens[0]
      evens = evens[1:]

print(result)

Solution (Python):
import sys

def main():
    line_odd = sys.stdin.readline().rstrip()
    line_ev = sys.stdin.readline().rstrip()

    len_odd = len(line_odd)
    len_ev = len(line_ev)
    if len_odd > len_ev:
        ans = "".join(["".join(tpl) for tpl in zip(line_odd, line_ev)]) + line_odd[-1]
        print(ans)
    elif len_odd < len_ev:
        ans = "".join(["".join(tpl) for tpl in zip(line_odd, line_ev)]) + line_ev[-1]
        print(ans)
    else:
        ans = "".join(["".join(tpl) for tpl in zip(line_odd, line_ev)])
        print(ans)
    return 0

if __name__ == '__main__':
    sys.exit(main())

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

A = []
i = 0

while O !=[] or E!=[]:
    A.append(O[i])
    del O[i]
    if E!=[]:
        A.append(E[i])
        del E[i]

print("".join(A))

Solution (Python):


odd = raw_input()
even = raw_input()

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

print res if len(odd) - len(even) == 0 else res + odd[-1]

Solution (Python):

from collections import deque


def list_n():
    return [int(e) for e in input().split()]


def main(o, e):
    answer = ''
    o = deque(o)
    e = deque(e)
    for i in range(len(o) + len(e)):
        if i % 2 == 0:
            answer += o.popleft()
        else:
            answer += e.popleft()
    return answer





if __name__ == '__main__':
    o = input()
    e = input()
    print(main(o, e))

Solution (Python):
O = input()
E = input()
Olen = len(O)
Elen = len(E)
LEN = max(Olen, Elen)
pw = ""
for i in range(LEN-1):
	pw += O[i] + E[i]
if Olen == Elen:
	pw += O[LEN-1] + E[LEN-1]
else:
	pw += O[LEN-1]
print(pw)

Solution (Python):

O = str(input())
E = str(input())
O = list(O)
E = list(E)
n = 0
arr = []
for i in range(len(O)*2):
    if n % 2 == 0:
        try:
            arr.append(O.pop(0))
        except:
            pass
    else:
        try:
            arr.append(E.pop(0))
        except:
            pass        
    n += 1
try:
    arr.append(O.pop(0))
except:
    pass

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

print(arr[-1])