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 os
import sys
import math
import numpy as np

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())
password = []
if len(O) - len(E) == 0:
    for i in range(len(O)):
        password.append(O[i])
        password.append(E[i])
elif len(O) - len(E) == 1:
    for i in range(len(E)):
        password.append(O[i])
        password.append(E[i])
    password.append(O[len(O)-1])
password = "".join(password)

print(password)

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

i = 0
s = ""

leno = len(o)
lene = len(e)

for i in range(lene):
    s += o[i] + e[i]
if leno > lene:
    s += o[leno-1]

print(s)

Solution (Python):
if __name__ == '__main__':
    odds, evens = (input() for _ in range(2))

    answer = []
    for odd, even in zip(odds, evens): answer.extend((odd, even))

    if len(odds) != len(evens):
        remains = odds if len(odds) > len(evens) else evens
        answer.append(remains[-1])

    print(''.join(answer))

Solution (Python):
O = input()
E = input()
E += '*' * (len(O) - len(E))
ans = ''
for i in range(len(O)):
    ans += O[i]
    ans += E[i]
if ans[-1] == '*':
    print(ans[:-1])
else:
    print(ans)

Solution (Python):
a = list(input())
b = list(input())
c = []
for i in range(len(b)):
    c.append(a[i])
    c.append(b[i])
if len(a) != len(b):
    c.append(a[-1])
print(''.join(c))

Solution (Python):

O=raw_input()
E=raw_input()

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


if len(O)>len(E):
    R=R+O[-1]
elif len(O)<len(E):
    R=R+E[-1]

print R

Solution (Python):
input_lines = str(input())
input_lines2 = str(input())

oCount = len(input_lines)
eCount = len(input_lines2)

o = list(input_lines)
e = list(input_lines2)

answer = ""

if oCount - eCount == 1:
    for i in range(oCount-1):
        answer = answer + o[i] + e[i]
    answer = answer + o[oCount-1]
else:
    for i in range(oCount):
        answer = answer + o[i] + e[i]

print(answer)

Solution (Python):
O = input()
E = input()
n = len(O)
m = len(E)
if n - m == 1:
	l = ""
	for i in range(m):
		l += O[i] + E[i]
	l += O[n -1]
	print(l)
else:
	l = ""
	for i in range(m):
		l += O[i] + E[i]
	print(l)

Solution (Python):
o = input()
e = input()
t = ""
for idx,ki in enumerate(o):
    t += ki
    if idx < len(e):
        t += e[idx]
print(t)

Solution (Python):
O = input()
E = input()
ans = ""
if len(O) - len(E) == 0:
    for i in range(0, len(O)):
        ans += O[i]
        ans += E[i]
else:
    for i in range(0, len(E)):
        ans += O[i]
        ans += E[i]
    ans += O[-1:]

print(ans)

Solution (Python):
odd = raw_input()
even = raw_input()

oddlength = len(odd)
evenlength = len(even)

i = 0
s = ''

while i < evenlength:
	s += odd[i]
	s += even[i]
	i += 1
	
if oddlength > evenlength:
	s += odd[oddlength-1]

print s

Solution (Python):
o = input()
e = input()
s = ""
n = max([len(o),len(e)])

for i in range(n):
    s += o[i]
    if i<=len(e)-1:
        s += e[i]

print(s)

Solution (Python):

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

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

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

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

Solution (Python):

O = raw_input()
E = raw_input()

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

Solution (Python):


if __name__ == "__main__":
    o_str = raw_input()
    e_str = raw_input()

    password = ""
    for o, e in zip(o_str, e_str):
        password += o
        password += e

    if len(o_str) != len(e_str):
        password += o_str[-1]

    print password

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

result = ""

for i in range(len(O)):
    result = result + O[i]
    try:
        result = result + E[i]
    except IndexError:
        break

print(result)

Solution (Python):
O = input()
E = input()
X = ""
for i in range(len(E)):
    X += (O[i]+E[i])
if len(O) != len(E):
    X += O[-1]

print(X)

Solution (Python):


import sys
import os
import math


A = input().strip()
B = input().strip()



if len(A) == len(B):
    for i in range(len(A)):
        print(A[i], end='')
        print(B[i], end='')
else:
    for i in range(len(B)):
        print(A[i], end='')
        print(B[i], end='')
    print(A[-1], end='')

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


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

print(ans)

Solution (Python):
import sys
import math

INF = 10**9+7

stdin = sys.stdin
def na(): return map(int, stdin.readline().split())
def ns(): return stdin.readline().strip()
def nsl(): return list(stdin.readline().strip())
def ni(): return int(stdin.readline())
def nil(): return list(map(int, stdin.readline().split()))

o = ns()
e = ns()

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

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

print(''.join(ans))

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

for i in range(len(b)):
	s += a[i]
	s += b[i]

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

print s

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