Problem:


Score : 200 points

Problem Statement

Snuke signed up for a new website which holds programming competitions.
He worried that he might forget his password, and he took notes of it.
Since directly recording his password would cause him trouble if stolen,
he took two notes: one contains the characters at the odd-numbered positions, and the other contains the characters at the even-numbered positions.

You are given two strings O and E. O contains the characters at the odd-numbered positions retaining their relative order, and E contains the characters at the even-numbered positions retaining their relative order.
Restore the original password.

Constraints

O and E consists of lowercase English letters (a - z).

1 \leq |O|,|E| \leq 50

|O| - |E| is either 0 or 1.

Input

Input is given from Standard Input in the following format:

O
E

Output

Print the original password.

Sample Input 1

xyz
abc

Sample Output 1

xaybzc

The original password is xaybzc. Extracting the characters at the odd-numbered positions results in xyz, and extracting the characters at the even-numbered positions results in abc.

Sample Input 2

atcoderbeginnercontest
atcoderregularcontest

Sample Output 2

aattccooddeerrbreeggiunlnaerrccoonntteesstt



Sample input:
xyz
abc


Sample output:
xaybzc

Submission status: Accepted

Solution code:
O=raw_input()
E=raw_input()
S=""
for i in range(len(O)):
	if i<len(E):
		S+=O[i]+E[i]
	else:
		if len(O)==len(E):
			S+=O[i]+E[i]
		else:
			S+=O[i]
print S

Submission status: Accepted

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

print(password)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
val = input()
val2 = input()

res = ""
for i in range(0, min(len(val), len(val2))):
    res += val[i]
    res += val2[i]

if len(val) == len(val2):
    pass
elif len(val) > len(val2):
    res += val[-1]
else:
    res += val2[-1]
print(res)

Submission status: Accepted

Solution code:
O = list(input())
E = list(input())
ans = "".join([x+y for x, y in zip(O, E)])
if len(O) > len(E):
    ans += O[-1]
if len(E) > len(O):
    ans += E[-1]
print(ans)

Submission status: Accepted

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

O=input()
E=input()

s=''

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

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

print(s)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
o=input()
e=input()
length=len(o)
length2=len(e)
for i in range(length+length2):
    if(i%2 == 0):
        print(o[int(i/2)],end='')
    else:
        print(e[int((i-1)/2)],end='')
print('')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = raw_input()
b = raw_input()
c = ""
count  = 0
while count < len(b) :
    c += a[count]+b[count]
    count += 1
try:
    c += a[count]
except:
    pass
print c

Submission status: Accepted

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

for i in range(len(e)):
    o.insert(i*2+1, e[i])

print(''.join(o))

Submission status: Accepted

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

ans = ''

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

ans += o[-1]

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

print(ans)

Submission status: Accepted

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

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

print(O[-1] if len(O) > len(E) else '')

Submission status: Accepted

Solution code:
a = input()
b = input()
c = ''
for i in range(len(b)):
    c = c + a[i]
    c = c + b[i]
if len(a) != len(b):
    c = c + a[-1]
print(c)

Submission status: Accepted

Solution code:
from itertools import zip_longest
O = input()
E = input()
for w, z in zip_longest(O, E):
    if w == None:
        print(z, end="")
    elif z == None:
        print(w, end="")
    else:
        print(w + z, end="")
print()

Submission status: Accepted

Solution code:
O = input()
E = input()
s = ''
N = len(E)
for i in range(N):
    s += O[i] + E[i]
if len(O) == N+1:
    s += O[N]
print(s)

Submission status: Accepted

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

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

print(s)

Submission status: Accepted

Solution code:
eve = raw_input()
odd = raw_input()

ans = ""

for i in range(len(eve)):
    ans += eve[i]
    if i < len(odd):
        ans += odd[i]

print ans

Submission status: Accepted

Solution code:
o=input()
e=input()
ans=[""]*(len(o)+len(e))
for i,s in enumerate(o):
    ans[2*i]=s
for i,s in enumerate(e):
    ans[2*i+1]=s
print("".join(ans))

Submission status: Accepted

Solution code:
def main():
    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)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
O,E = input(), input()
ans = ''
for a,b in zip(O,E):
    ans += a
    ans += b
if len(O) > len(E): ans += O[-1]
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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="")

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-

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

Submission status: Accepted

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

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

print(pw)

Submission status: Accepted

Solution code:
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)

Submission status: Accepted

Solution code:
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)

Submission status: Accepted

Solution code:
# ∵∴∵

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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="")

Submission status: Accepted

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


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

Submission status: Accepted

Solution code:
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))

Submission status: Accepted

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

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)

Submission status: Accepted

Solution code:
import sys

# sys.stdin = open('b1.in')


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)

Submission status: Accepted

Solution code:
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)

Submission status: Accepted

Solution code:

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)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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 ""))

Submission status: Accepted

Solution code:
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="")

Submission status: Accepted

Solution code:
from __future__ import print_function

o = raw_input()
e = raw_input()

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
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)

Submission status: Accepted

Solution code:
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)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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)

Submission status: Accepted

Solution code:
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)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
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)

Submission status: Accepted

Solution code:
# coding: utf-8

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# 整数の入力
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)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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 = '')

Submission status: Accepted

Solution code:
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)

Submission status: Accepted

Solution code:
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)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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)

Submission status: Accepted

Solution code:
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))

Submission status: Accepted

Solution code:
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))

Submission status: Accepted

Solution code:
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)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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='')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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))

Submission status: Accepted

Solution code:
#! /usr/bin/env python
# -*- coding: utf-8 -*-

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

Submission status: Accepted

Solution code:
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)

Submission status: Accepted

Solution code:
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)

Submission status: Accepted

Solution code:
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("");

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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)

Submission status: Accepted

Solution code:
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)

Submission status: Accepted

Solution code:
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 = '')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(S)

Submission status: Accepted

Solution code:
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)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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

Submission status: Accepted

Solution code:
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)

Submission status: Accepted

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

if len(b)+1 == len(a):
    d = d+ a[len(a)-1]

print(d)

Submission status: Accepted

Solution code:
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))

Submission status: Accepted

Solution code:
# 文字列の入力
O = input()
E = input() + " "

L = len(O)
TMP = ""

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

print(TMP.strip())

Submission status: Accepted

Solution code:
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)

Submission status: Accepted

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

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

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

print(str)

Submission status: Accepted

Solution code:
#すぬけ君は新しくできたプログラミングコンテストに会員登録しました。 登録に使ったパスワードを覚えておく自信が無かったすぬけ君は、 手元の紙にパスワードをメモしておくことにしました。 ただし、そのままメモをすると誰かにパスワードを盗まれてしまうかもしれないので、 文字列の偶数番目の文字と奇数番目の文字をそれぞれ別々の紙にメモしておくことにしました。
#パスワードの奇数番目の文字だけを順番を変えずに取り出した文字列 O と、 偶数番目の文字だけを順番を変えずに取り出した文字列 E が与えられます。 すぬけ君のかわりにパスワードを復元してください。
o = input()
e = input()
r = ''
for i in range(len(o)):
  r += o[i]
  if i < len(e):
    r += e[i]
print(r)

Submission status: Accepted

Solution code:
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)

Submission status: Accepted

Solution code:

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)

Submission status: Accepted

Solution code:
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

Submission status: Accepted

Solution code:
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)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys

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

num = len(estr)
ans = ""

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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)

Submission status: Accepted

Solution code:
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

Submission status: Accepted

Solution code:
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)

Submission status: Accepted

Solution code:
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

Submission status: Accepted

Solution code:
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)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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)

Submission status: Accepted

Solution code:
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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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))))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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))

Submission status: Accepted

Solution code:
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

Submission status: Accepted

Solution code:
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

Submission status: Accepted

Solution code:
#ABC058B

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

Submission status: Accepted

Solution code:
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)

Submission status: Accepted

Solution code:
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)

Submission status: Accepted

Solution code:
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)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
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)

Submission status: Accepted

Solution code:
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))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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

Submission status: Accepted

Solution code:
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)

Submission status: Accepted

Solution code:
#coding=UTF-8

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)

Submission status: Accepted

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


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

Submission status: Accepted

Solution code:
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)

Submission status: Accepted

Solution code:
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 ''
)

Submission status: Accepted

Solution code:
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)