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

Submission status: Accepted

Solution code:
# coding: utf-8

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#! coding: UTF-8
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))

Submission status: Accepted

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

Submission status: Accepted

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

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)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#coding:utf-8


o = list(str(raw_input()))  # 奇数
e = list(str(raw_input()))  # 偶数
out=[]
# print o
# print e
# print len(o)
# print len(e)
# count =0
if len(o)>len(e):
    for i in range(len(e)):
        # if i == len(o):
        #     out.append(o[i])
        #     print a
        #     break
        # else:
        out.append(o[i])
        out.append(e[i])
    out.append(o[-1])
        # count+=1
else:
    for i in range(len(e)):
        out.append(o[i])
        out.append(e[i])
        # count +=1
# print out
# out = [1,2,3,4,5]
# out_str = map(str,out)
# print out_str #=> "1,2,3,4,5"
# print count
print "".join(out)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env 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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8

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]

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#coding:utf-8

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

Submission status: Accepted

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

Submission status: Accepted

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

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='')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Runtime Error

Solution code:
o=input()
e=input()
a=[]
for i in range(max(len(o),len(e))):
    a.append(o[i]+e[i])
b=''.join(a)
print(b)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

ans = []

for i in range(len(a)):
    ans.append(a[i])
    if b[i]:
        ans.append(b[i])
print(''.join(ans))

Submission status: Runtime Error

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

ans = []

for i in range(len(a)):
    ans.append(a[i])
    ans.append(b[i])
print(''.join(ans))

Submission status: Runtime Error

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

def main():
    a = input()
    b = input() + [""]
    for i in range(len(a)):
        print(a[i], end="")
        print(b[i], end="")


if __name__ == "__main__":
    main()

Submission status: Runtime Error

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

print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:

#ABC058B
o = input()
e = input()

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

Submission status: Runtime Error

Solution code:
O=input()
E=inpu()
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: Runtime Error

Solution code:
a = input()
b = input()
f = False
x = []
if len(a)> len(b):
    b.append(0)
    f = True
for i in range(len(a)):
    x.append(a[i]+b[i])
if f:
    x.pop()
print("".join(x))

Submission status: Runtime Error

Solution code:
#58B
A=input()
B=input()
import ita
pasw=ita.array.make1d(len(A)+len(B)+1)
for i in range(0,len(A)):
    pasw[2*i]=A[i]
for j in range(0,len(B)):
    pasw[2*j+1]=B[j]
print(pasw)

Submission status: Runtime Error

Solution code:
a=input()
b=input()
c=len(a)
d=len(b)
x=""
if c<=d:
  for i in range(c):
    x=x+c[i]
    x=x+d[i]
  print(x)
if c>d:
  for i in range(d):
    x=x+c[i]
    x=x+d[i]
  x=x+c[len(a)-1]
  print(x)

Submission status: Runtime Error

Solution code:
a=input()
b=input()
x=""
for i in range(len(a)//2):
  x=x+a[2i]
for i in range(len(b)//2):
  x=x+b[2i+1]
print(x)

Submission status: Runtime Error

Solution code:
odd = list(map(str, input()))
even = list(map(str, input()))
L=len(odd)*2
li=[]

for i in range(1,L+1):
  if i%2==1:
    if i==1:
      li.append(odd[0])
    else:
      li.append(odd[i//2])
  else:
    li.append(even[i//2-1])
    
print(''.join(li))

Submission status: Runtime Error

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

for i in range(len(O)):
  Ans.append(O[i])
  Ans.append(E[i])
  
mojiretu = ''.join(Ans)
print(mojiretu)

Submission status: Runtime Error

Solution code:
o = str(input())
s = str(input())
n = ""

if not len(o) == len(s):
	for i in range(min(len(o),len(s))):
		n += o[i]
		n += s[i]

	if len(o) > len(s):
		n += o[len(o)-1]

	if len(s) > len(o):
		n += s[len(s)-1]

else:
	for i in rage(len(o)):
		n += o[i]
		n += s[i]
		
print(n)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a = input()
b = input()
print(''.join([a[i]+b[i] for i in range(o,max(len(a),len(b)))]))

Submission status: Runtime Error

Solution code:
o = input()
e = input()
n = []
e.append(' ')
for i in range(o):
  n.append(o[i])
  n.append(e[i])
print(''.join(n).strip())

Submission status: Runtime Error

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 itertools.zip_longest(o, e, fillvalu=''):
  s += a + b
print(s)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

ls=len(s)
lt=len(t)
v=''
for i in range(ls):
    v+=s[i]+t[i]
if lt!=ls:
    v+=t[-1]
print(v)

Submission status: Runtime Error

Solution code:
N=input()
M=input()
N=list(str(N))
M=list(str(M))
ans=[]
for i in range(len(N)):
  ans.append(N[i])
  ans.append(M[i])
print("".join(ans))

Submission status: Runtime Error

Solution code:
o,e = [input() for i in range(2)]

print(*[o[i]+e[i] for i in range(len(o))], sep='')

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
def odd(a,b):
    if len(a)%2==1:
        return a
    if len(b)%2==1:
        return b

O = list(input())
E = list(input())
ans = ''

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

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

Submission status: Runtime Error

Solution code:
from itertools import zip_longest
O = list(input())
E = list(input())
ans =''
for a,b in zip_longest(O,E):
    ans+=a+b
print(ans)

Submission status: Runtime Error

Solution code:
O,E = input(),input()
ans = ''
for i in range(len(O)):
    ans += O[i] + E[i]
print(ans)

Submission status: Runtime Error

Solution code:
from itertools import zip_longest

o=input()
e=input()

print(''.join([x+y for x,y in zip_longetst(o,e,fillvalue='')]))

Submission status: Runtime Error

Solution code:
from collections import deque

O=input()
E=input()

o=deque(O)
e=deque(E)

s=''
While True:
  if not e a and not o:
    break
  elif o:
    s+=o.pop()
  elif e:
    s+=e.pop()
    
  
print(s)

Submission status: Runtime Error

Solution code:
from collections import deque

O=input()
E=input()

o=deque(O)
e=deque(E)

s=''
While True:
  if not e a and not o:
    break
  elif o:
    s+=o.pop()
  elif e:
    s+=e.pop()

Submission status: Runtime Error

Solution code:
#その10

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

Submission status: Runtime Error

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

s=''
try:
  for i in range(len(O)):
    s += O[i]
    s+= E[i]
finally:
  print(s)

Submission status: Runtime Error

Solution code:
import sys
def rs(): return sys.stdin.readline().rstrip()
def ri(): return int(rs())
def rs_(): return [_ for _ in rs().split()]
def ri_(): return [int(_) for _ in rs().split()]

import numpy as np
v = np.stack([np.array(list(rs()),dtype=object), np.array(list(rs()),dtype=object)])
v = v.T.flatten()
print(''.join(v))

Submission status: Runtime Error

Solution code:
O = str(input())
E = str(input())
st = ''
for i in range(len(O)):
    st += O[i]
    st+= E[i]
    
print(st)

Submission status: Runtime Error

Solution code:
atcoderbeginnercontest
atcoderregularcontest

Submission status: Runtime Error

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:
        break
    else:
        huku.append(a[i])
        huku.append(b[i])
for i in range(len(huku)):
    print(huku[i],end="")

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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: Runtime Error

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: Runtime Error

Solution code:
s=input()
t=input()
k=[]
for i in range(len(t)):
    k.append(s[i])
    k.append(t[i])
if len(s)>len(t):
    t.append(s[len(s)-1])
print("".join(k))

Submission status: Runtime Error

Solution code:
O = input()
E = input()
P = ''
for i in range(min(len(O)+1,len(E)+1)) :
    P = P + O[i]
    P = P + E[i]
print(P)

Submission status: Runtime Error

Solution code:
O = str(input())
E = str(input())
P = ''
for i in range(len(O)+len(E)) :
    P = P + O[i]
    P = P + E[i]
print(P)

Submission status: Runtime Error

Solution code:
O = input()
E = input()
P = ''
for i in range(len(O)+len(E)) :
    P = P + O[i]
    P = P + E[i]
print(P)

Submission status: Runtime Error

Solution code:

from collections import Counter

k = input()
p = input()
d = len(k)
f = len(p)
g=""
diff = abs(d-f)

if d>f :
     d = d-diff
     g = k[d:len(k)]
   
else:
    f = f-diff
    g=p[f:len(p)]


r=""a
i = 0
for i in range(d):
    r += "".join(k[i]+p[i])
    #print(r)
    
print(r+g)

Submission status: Runtime Error

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

K = len(O)
String = ""

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

print(String)

Submission status: Runtime Error

Solution code:
o = str(input())
e = str(input())
s = []
for i in range(len(e)):
    s.append(o[i])
    s.append(e[i])
if len(o) - len(e) = 1:
    s.append(o[-1])
print(*s, sep = "")

Submission status: Runtime Error

Solution code:
o = str(input())
e = str(input())
s = []
for i in range(len(o)):
    s.append(o[i])
    s.append(e[i])
print(*s, sep="")

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

if len(O) > len(E):
  s = s + O[len(O)]

print(s)

Submission status: Runtime Error

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

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

if len(0) > len(E):
  s = s + O[len(O)]

print(s)

Submission status: Runtime Error

Solution code:
o = list(input())
e = list(input())
ans = []
for i in range(len(o)):
    ans.append(o[i])
    ans.append(e[i])
print("".join(ans))

Submission status: Runtime Error

Solution code:
s = input()
t = input()
n = len(s)
for i in range(n):
  if i%2:
    print(t[i], end="")
  else:
    print(s[i], end="")
print()

Submission status: Runtime Error

Solution code:
s = input()
t = input()
n = len(s)
for i in range(n):
  if i%2:
    print(s[i], end="")
  else:
    print(t[i], end="")
print()

Submission status: Runtime Error

Solution code:
o = input()
e = input()
lo = len(o)
le = len(e)

if lo >= le: l = lo
else: l = le

s = ""
for i in range(l):
        s += o[i]
        s += e[i]
print(s)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
def f07():
    O=input()
    E=input()
    print(''.join([O[i]+E[i] for i in range(len(O))]))
f07()

Submission status: Runtime Error

Solution code:
A = input()
B = input()
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: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
o = input()
e = input()
ans = ''
n = len(o)
a = 0
while a < n:
  ans += o[a]
  if a <= len(e):
    ans += e[a]
  a += 1
print(ans)

Submission status: Runtime Error

Solution code:
o=str(input())
e=str(input())
s="A"
for i in range(0,len(o)):
  s=s+o[i]+e[i]
s=s.lstrip("A")
print(s)

Submission status: Runtime Error

Solution code:
O=input()
E=input()
for i in range(len(O)*2):
    if i%2==0:
        print(O[i//2],end="")
    else:
        print(E[i//2],end="")

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
o = input()
e = input()
ans_l = [0] * (len(o) + len(e))
for i in range(len(o)):
    ans_l[i*2] = o[i]
for j in range(len(e)):
    ans_l[j*2+1] = e[i]
print(''.join(ans_l))

Submission status: Runtime Error

Solution code:
o = list(input())
e = list(input())
ans = []
for i in range(len(o)):
  ans.append(o[i])
  ans.append(e[i])
print("".join(ans))

Submission status: Runtime Error

Solution code:
import sys

sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7


def resolve():
    o = input()
    e = input()
    res = []
    for i in range(len(o)):
        res.append(o[i])
        res.append(e[i])
    print("".join(res))


if __name__ == '__main__':
    resolve()

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<long long> vll;

int main()
{
	ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    string A,B;
    cin>>A>>B;
    for(ll i=0;i<A.size();i++)
    {
        cout<<A[i];
        if(i<B.size())
        {
            cout<<B[i];
        }
            
    }
    return 0;

}

Submission status: Runtime Error

Solution code:
o=list(input())
e=list(input())
p=[]
l=len(o)
for a in range(l):
    p.append(o.pop(0))
    p.append(e.pop(0))
if len(o):
    p.append(o.pop(0))
print("".join(p))

Submission status: Runtime Error

Solution code:
o = list(input())
e = list(input())
e_ni = e.append('a')
l = []
if len(o) == len(e):
  for i in range (len(o)):
  a = o[i]
  b = e[i]
  l.append(a)
  l.append(b)
else:
  for i in range (len(o)):
  a = o[i]
  b = e[i]
  l.append(a)
  l.append(b)
  del l[-1]
s = ''.join(l)
print(s)

Submission status: Runtime Error

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

for i in range (len(o)):
  a = o[i]
  b = e[i]
  l.append(a)
  l.append(b)

s = ''.join(l)

print(s)

Submission status: Runtime Error

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

for i in range (len(o)):
  a = o[i]
  b = e[i]
  l.append(a)
  l.append(b)

s = ''.join(l)

print(s)