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 sys

O = list(input())
E = list(input())
if len(O) - len(E) == 1:
    E.append('')
for o, e in zip(O, E):
    sys.stdout.write(o + e)
print()

Submission status: Accepted

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

Submission status: Accepted

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

n = len(o+e)

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
o = list(input())
e = list(input())
oe = []
for i in range(len(e)):
         oe.append(o[i])
         oe.append(e[i])
if len(o) != len(e):
         oe.append(o[len(o)-1])
print(''.join(oe))

Submission status: Accepted

Solution code:
o = list(input())
e = list(input())
oe = []
for i in range(len(e)):
         oe.append(o[i])
         oe.append(e[i])
if len(o) != len(e):
         oe.append(o[len(o)-1])
ans = ''.join(oe)
print(ans)

Submission status: Accepted

Solution code:
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
 
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
 
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

a = list(input())
b = list(input())
l = []
# count = 0
while len(a) != 0 or len(b) != 0:
    # print(a.pop(0))
    if len(a) != 0:
        l.append(a.pop(0))
        # print(a.pop(0))
    if len(b) != 0:
        l.append(b.pop(0))
        # print(b.pop(0))
    # print(l)
print("".join(l))

Submission status: Accepted

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

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

if len(o) > i+1:
    print(o[-1])
elif len(e) > i+1:
    print(e[-1])

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//2]
print(ans)

Submission status: Accepted

Solution code:
"""
author : halo2halo
date : 31, Jan, 2020
"""

import sys

# import itertools
# import numpy as np

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

O, E = read().decode('utf8').split()

ans = ''
for i, j in zip(O, E):
    ans += i + j

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

print(ans)

Submission status: Accepted

Solution code:
A=str(input())
B=str(input())
a=list(A)
b=list(B)
t=''
for i in range(len(b)):
  t+=a[i]+b[i]
if len(a)>len(b):
  t+=a[len(a)-1]
print(t)

Submission status: Accepted

Solution code:
O=input()
E=input()
A = [O[i]+E[i] for i in range(len(E))]
if len(O) != len(E):
    A += O[-1]
print("".join(A))

Submission status: Accepted

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

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

print(p)

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
o=list(input())
e=list(input())+[""]
for x,y in zip(o,e):
  print(x+y,end="")

Submission status: Accepted

Solution code:
even = input()
odd = input()
if (len(even) - len(odd)) % 2 == 0:
    for i in range(len(even)):
        print(even[i], odd[i], sep="", end="")
else:
    for i in range(len(even)-1):
        print(even[i], odd[i], sep="", end="")
    print(even[-1])

Submission status: Accepted

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

Submission status: Accepted

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

for x,y in zip(o,e):
    print(x+y,end='')

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
odd = input()
even = input()
s=""

for i in range(len(odd)+len(even)):
  if i % 2 == 0:
    s += odd[i//2]
  else:
    s += even[(i-1)//2]
print(s)

Submission status: Accepted

Solution code:
a = list(input())
b = list(input())+[""]
for c,d in zip(a,b):
  print(c+d,end="")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SI(): return sys.stdin.readline()[:-1]

def main():
    s0 = SI()
    s1 = SI()
    ans = [""] * (len(s0) + len(s1))
    for i in range(len(s0)):
        ans[i * 2] = s0[i]
    for i in range(len(s1)):
        ans[i * 2 + 1] = s1[i]
    print("".join(ans))

main()

Submission status: Accepted

Solution code:
o, e = input(), input()
d = len(o) - len(e)

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

print(ans)

Submission status: Accepted

Solution code:
# coding: utf-8
O = input()
E = input()
ans = ""
o_idx, e_iex = 0, 0
for i in range(len(O)+len(E)):
    if i % 2 == 1:
        ans += E[e_iex]
        e_iex += 1
    else:
        ans += O[o_idx]
        o_idx += 1
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
o = list(input())
e = list(input()) + ['']
 
for i,j in zip(o,e):
  print(i,j,sep='',end='')

Submission status: Accepted

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

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

if len(o) - len(e) == 1:
  print(o[-1],end='')

Submission status: Accepted

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

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

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

print(ans)

Submission status: Accepted

Solution code:
from itertools import zip_longest
s1=input()
s2=input()
ans=''
for ss1,ss2 in zip_longest(s1,s2):
  if ss1 == None:
    ss1=''
  if ss2 == None:
    ss2=''
  ans+=ss1+ss2
  
print(ans)

Submission status: Accepted

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

a = len(o)-len(e)
s = ""

if a == 0:
    for i in range(len(o)):
         s += o[i] + e[i]
else:
    for i in range(len(o)-1):
        s += o[i] + e[i]
    s += o[len(o)-1]
print(s)

Submission status: Accepted

Solution code:
#codng utf-8
O=[i for i in input()]
E=[i for i in input()]
m=len(O)
n=len(E)
ans=''
for i in range(len(O)-1):
    ans+=O[i]
    ans+=E[i]
if len(O)-len(E)==0:
    ans+=O[n-1]
    ans+=E[n-1]
    print(ans)
else:
    ans+=O[m-1]
    print(ans)

Submission status: Accepted

Solution code:
# coding: utf-8
O=list(input())
E=list(input())
passward =""

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

if len(E)<len(O):
    passward+=O[-1]
print(passward)

Submission status: Accepted

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

while len(t) > 0:
  ans += s[0] + t[0]
  s = s[1:]
  t = t[1:]
  
ans += s

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
O = list(input())
E = list(input())
if len(O) == len(E) :
    pas = ['8'] * (2 * len(O))
    for i in range(len(O)) :
        pas[2*i] = O[i]
        pas[2*i + 1] = E[i]
    p = ''.join(pas)
    print(p)
else :
    pas = ['0'] * (2 * len(E) + 1)
    for i in range(len(E)) :
        pas[2*i] = O[i]
        pas[2*i +1] = E[i]
    pas[2 * len(E)] = O[-1]
    p = ''.join(pas)
    print(p)

Submission status: Accepted

Solution code:
O = list(input())
E = list(input())+[""]
for x, y in zip(O, E):
    print(x+y,end="")

Submission status: Accepted

Solution code:
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
    O=STR()
    E=STR()
    ans=[]
    ol=len(O)
    el=len(E)
    if ol-el==0:
        for i in range(ol):
            ans.append(O[i])
            ans.append(E[i])
    else:
        for i in range(el):
            ans.append(O[i])
            ans.append(E[i])
        ans.append(O[-1])
    print(*ans,sep='')
if __name__ == '__main__':
    do()

Submission status: Accepted

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

ans = []
for i in range(len(O)):
    ans.append(O[i])
    if len(E) > i:
        ans.append(E[i])
    else:
        break
print("".join(ans))

Submission status: Accepted

Solution code:
#python3
from itertools import zip_longest

def main():
    o = input()
    e = input()
    for i, j in zip_longest(o, e):
        print(i, end='')
        if j != None:
            print(j, end='')

main()

Submission status: Accepted

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

ans = [0] * (len(o) + len(e))

for i in range(len(o)):
    ans[i * 2] = o[i]

for i in range(len(e)):
    ans[i * 2 + 1] = e[i]

print("".join(ans))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:

O = input()
E = input()

ans = []

for i in range(50):
    try:
        ans.append(O[i])
        ans.append(E[i])
    except:
        break

print("".join(ans))

Submission status: Accepted

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

ans = []

for i in range(1, len(o) + len(e) + 1):
	if i % 2 == 1:

		ans.append(o.pop(0))
	else:
		ans.append(e.pop(0))

print("".join(ans))

Submission status: Accepted

Solution code:
O, E = [input() for _ in range(2)]

pass_word = []
for i in range(len(O)):
  if len(O) > len(E) and i == len(O) - 1:
    pass_word.append(O[i])
  else:
    pass_word.append(O[i])
    pass_word.append(E[i])

ans = "".join(pass_word)
print(ans)

Submission status: Accepted

Solution code:
O=list(input())
E=list(input())
len_=len(E)
for i in range(len_):
    O.insert(i*2+1,E[i])
print(''.join(O))

Submission status: Accepted

Solution code:
# AtCoder Beginner Contest 058 - B
# -*- encoding: UTF-8 -*-
o = list(input())
e = list(input())

s = []
for i in o:
  s.append(i)
  if len(e) > 0:
    s.append(e.pop(0))

result = "".join(s)

print(result)

Submission status: Accepted

Solution code:
a = list(input())
s = list(input())
x = -1
while s != []:
    x += 2
    a.insert(x,s[0])
    s.pop(0)
print(''.join(a))

Submission status: Accepted

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

ans =[]
while True:
    if len(O):
        ans.append(O.pop(0))
    if len(E):
        ans.append(E.pop(0))

    if len(O)==0 and len(E)==0:
        break

print("".join(ans))

Submission status: Accepted

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

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

print(s)

Submission status: Accepted

Solution code:
a,b = list(input() for i in range(2))
str = ''
num = len(a)
if len(a) > len(b):
  b = b + ' '

for i in range(num):
  str = str + a[i] + b[i]
print(str.replace(' ', ''))

Submission status: Accepted

Solution code:
a,b = list(input() for i in range(2))
str = ''
num = max(len(a),len(b))
if len(a) < num:
  a = a + ' '
if len(b) < num:
  b = b + ' '
for i in range(num):
  str = str + a[i] + b[i]
print(str.replace(' ', ''))

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

Solution code:
from itertools import zip_longest
odd_num = input()
even_num = input()

print(''.join([x + y for x, y in zip_longest(odd_num, even_num, fillvalue='')]))

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
o=input().strip()
e=input().strip()
ans=""
for i in range(len(e)):
    ans+=o[i]+e[i]
if len(o)>len(e):
    ans+=o[-1]
print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

for i in range(min(len(s),len(t))):
    ans+=s[i]
    ans+=t[i]

if len(s)==len(t):
    print(ans)

elif len(s)>len(t):
    ans+=s[-1]
    print(ans)

else:
    ans+=t[-1]
    print(ans)

Submission status: Accepted

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

import itertools
passwd = [o+e for o, e in itertools.zip_longest(O, E, fillvalue='')]
passwd = ''.join(passwd)
print(passwd)

Submission status: Accepted

Solution code:
x=list(input())
y=list(input())+['']
for a, b in zip(x, y):
  print(a+b, end='')

Submission status: Accepted

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

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

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

print(result)

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 // 2]

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
O = list(input().rstrip())
E = list(input().rstrip())
if len(O) == len(E):
    ans = []
    for i, j in zip(O, E):
        ans.append(i)
        ans.append(j)
else:
    ans = [O.pop(0)]
    for i, j in zip(O, E):
        ans.append(j)
        ans.append(i)
print("".join(ans))

Submission status: Accepted

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

if (len(o) <= len(e)):
   x = len(o)
else:
   x = len(e)

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
o = input()
e = 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(o)-1):
        password += o[i]
        password += e[i]
    password += o[-1]
print(password)

Submission status: Accepted

Solution code:
o = str(input())
e = str(input())
lst = []

if len(o)==len(e):
    for i in range(len(o)):
        lst.append(o[i])
        lst.append(e[i])
    print(''.join(lst))
else:
    for i in range(len(e)):
        lst.append(o[i])
        lst.append(e[i])
    lst.append(o[-1])
    print(''.join(lst))

Submission status: Accepted

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

o = input()
e = input()

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


ans = ""

while True:
    try:
        ans += o.pop(0)
        ans += e.pop(0)
    except:
        break

print(ans)

Submission status: Accepted

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

n = len(o)
for x, y in zip(o, e):
  print(x + y, end='')

Submission status: Accepted

Solution code:
O = input()
E = input()
oc = len(O)
oe = len(E)
word = "" 
if oc < oe:
    for i in range (oc):
        word = word+O[i]+E[i]
    word = word+E[oc:oe]
    print(word)
elif oc > oe:
    for i in range (oe):
        word = word+O[i]+E[i]
    word = word+O[oe:oc]
    print(word)
else:
    for i in range (oe):
        word = word+O[i]+E[i]
    print(word)

Submission status: Accepted

Solution code:
o = list(input())
e = list(input())+[""]
#print(o,e)
for x,y in zip(o,e):
 print(x+y,end="")

Submission status: Accepted

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

for i in range(len(e)):
    print("{}{}".format(o[i], e[i]), end='')
if len(o) != len(e):
    print(o[-1])
else:
    print()

Submission status: Accepted

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

Submission status: Accepted

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

result = ""
for i in range(len(e)):
    result = result + o[i] + e[i]

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

Submission status: Accepted

Solution code:
import itertools
a=[i for i in input()]
b=[i for i in input()]
l=list(itertools.zip_longest(a,b,fillvalue=0))
ll=[]
for i in l:
  if i[0]!=0:
    ll.append(i[0])
  if i[1]!=0:
    ll.append(i[1])  
print("".join(ll))

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(O)-1])

Submission status: Accepted

Solution code:
O=list(input())
E=list(input())
L=[]

if len(O)==len(E):
    for i in range(len(O)):
        L.append(O[i])
        L.append(E[i])
else:
    for i in range(len(E)):
        L.append(O[i])
        L.append(E[i])
    L.append(O[len(O)-1])
L="".join(L)
print(L)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
o=input()
e=input()
len_o,len_e=len(o),len(e)
ans=""
for i in range(len_o-1):
    ans+=(o[i]+e[i])
if len_o==len_e:
    ans+=(o[len_o-1]+e[len_e-1])
else:
    ans+=(o[len_o-1])
print(ans)

Submission status: Accepted

Solution code:
o=input()
e=input()
ans=''
for i in range(1,len(e)*2+1):
    if i%2==1:
        ans+=o[i//2]
    else:
        ans+=e[i//2-1]
if len(o)==len(e):
    print(ans)
else:
    ans+=o[len(o)-1]
    print(ans)

Submission status: Accepted

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

ans = [a+b for a,b in zip(o,e)]
print("".join(ans))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
 
import math
import itertools
import sys
import copy
 
# 入力
#N, M = map(int, input().split())
#N = int(input())
#S = str(input())
O = str(input())
E = str(input())

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

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

print (s)

Submission status: Accepted

Solution code:
O=list(input())
E=list(input()) + [""]

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

Submission status: Accepted

Solution code:

o = list(input())
e = list(input())
ans = []

count = 0

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

print("".join(ans))

Submission status: Accepted

Solution code:

o = list(input())
e = list(input())
ans = []

count = 0

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

print("".join(ans))

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
o = list(input())
e = list(input())+[""]
for x,y in zip(o,e):
  print(x+y,end="")

Submission status: Accepted

Solution code:
import sys
MAX_INT = int(10e12)
MIN_INT = -MAX_INT
mod = 1000000007
sys.setrecursionlimit(1000000)
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

s = S()
t = S()

sN = len(s)
tN = len(t)

ans = ""
for ss,tt in zip(s,t):
  ans += ss + tt

if sN == tN:
  pass
else:
  ans += s[-1]

print(ans)

Submission status: Accepted

Solution code:
from itertools import zip_longest

odds, evens = [input() for _ in range(2)]
chars = []
for odd, even in zip_longest(odds, evens, fillvalue=""):
    chars.append(odd)
    chars.append(even)
ans = "".join(chars)
print(ans)

Submission status: Accepted

Solution code:
import math

o, e = [input() for i in range(2)]
for i in range(len(e)):
    print(o[i], end="")
    print(e[i], end="")
if len(o) > len(e):
    print(o[-1])

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf')
ans = 0 ;count = 0 ;pro = 1

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

Submission status: Accepted

Solution code:
o = input()
e = input()
if len(o)-len(e)>0:e+=" "
for a,b in zip(o,e):
    print(a+b.strip(),end="")

Submission status: Accepted

Solution code:
#yandy スマート
o = input()
e = input()
 
ans = ''
for i in range(len(e)):
    ans += o[i] + e[i]
 
if len(o) > len(e):
    ans += o[-1]
 
print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
o = list(input())
e = list(input())
if len(o) > len(e):
  e.append("")
 
for i in range(len(o)):
  print(o[i] + e[i], end='')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

o, e = sys.stdin.read().split()

def main():
    s = [None] * (len(o) + len(e))
    s[::2] = list(o)
    s[1::2] = list(e)
    return ''.join(s)

if __name__ == '__main__':
    ans = main()
    print(ans)

Submission status: Accepted

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

answer = ''

for s,t in zip(o,e):
  answer += s
  answer += t

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

print(answer)

Submission status: Accepted

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

answer = ''

for s, t in zip(o,e):
  answer += s
  answer += t
  
if len(o) > len(e):## an example: o = 'aaaa', e = 'bbb'
  answer += o[-1]
  
print(answer)

Submission status: Accepted

Solution code:
#58b
O = str(input())
E = str(input())

ans = ""

for i in range(len(E)):
    ans += O[i] +E[i]
    
if len(O)!=len(E):
    ans += O[-1]
    
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
o=list(input())
e=list(input())+[""]
for x,y in zip(o,e):print(x+y, end = "")

Submission status: Accepted

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

ans = [i + j for i,j in zip(O,E)]
if len(O)-len(E) == 1:
  ans += O[-1]
print("".join(ans))

Submission status: Accepted

Solution code:
O = list(input())
E = list(input())+[""]

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

Submission status: Accepted

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

ans = ''
i1 = 0
i2 = 0
for i in range(len(o) + len(e)):
    if i % 2 == 0:
        ans += o[i1]
        i1 += 1
    else:
        ans += e[i2]
        i2 += 1
print(ans)

Submission status: Accepted

Solution code:
odd_chars = input()
even_chars = input()
output_chars = ""

for i in range(len(even_chars)):
    output_chars += odd_chars[i] + even_chars[i]

if len(odd_chars) > len(even_chars):
    output_chars += odd_chars[-1]

print(output_chars)

Submission status: Accepted

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

for x, y in zip(o, e):
    print(x + y, end='')

Submission status: Accepted

Solution code:
O, E = [input() for _ in range(2)]
E += " "

for i in range(len(O)):
    print(O[i], end='')
    print(E[i], end='')

Submission status: Accepted

Solution code:
from itertools import zip_longest

O = input()
E = input()

ans = []
for o, e in zip_longest(O, E):
    ans.append(o)
    ans.append(e)

ans = [s for s in ans if s]
print("".join(ans))

Submission status: Accepted

Solution code:
O = input()
O_2 = list(O)
OLEN = len(O)

E = input()
E_2 = list(E)
ELEN = len(E)

ans = []

if ELEN >= OLEN:
    N = ELEN
else:
    N = OLEN



if OLEN == ELEN:
    for i in range(N):
        ans.append(O_2[i])
        ans.append(E_2[i])

elif OLEN  != ELEN:
    
    for i in range(N):
        if len(ans) == ((OLEN) + (ELEN) -1):
            if OLEN > ELEN:
                ans.append(O_2[-1])
            else:
                ans.append(E_2[-1])
            break
        ans.append(O_2[i])
        ans.append(E_2[i])


for i in ans:
  print(i,end="")

Submission status: Accepted

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

while True:
    try:
        print(o.pop(),end="")
        print(e.pop(),end="")
    except:
        break

Submission status: Accepted

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

l_o = len(o)
l_e = len(e)

PW = ""

if l_o == l_e:
    for i in range(l_e):
        PW += o[i]
        PW += e[i]
    print(PW)
else:
    for i in range(l_e):
        PW += o[i]
        PW += e[i]
    print(PW + o[l_o - 1])

Submission status: Accepted

Solution code:
k=input()
g=input()
ans=""
x=len(k)
y=len(g)
for i in range(max(x,y)):
    if i<x:
        ans+=k[i]
    if i<y:
        ans+=g[i]
print(ans)

Submission status: Accepted

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

l = []
for i in range(len(o)*2):
    if i %2 == 0:
        l.append(o[i//2])
    elif i//2 < len(e):
        l.append(e[i//2])
    else:
        pass

print(''.join(l))

Submission status: Accepted

Solution code:
O = input()
E = input()
al = ""
for o,e in zip(O,E):
  al += o
  al += e
if len(O) > len(E):
  #print(len(O) - len(E))
  for i in range(abs(len(O) - len(E)),0,-1):
    al += O[-i]
elif len(E) > len(O):
  for i in range(abs(len(O) - len(E)),0,-1):
    al += E[-i]
# for i in range(1,len(O) + len(E) + 1):
#   if i % 2 == 1:
#     al += O[i]
#   else:
#     al += E[i]
print(al)

Submission status: Accepted

Solution code:
O=list(input())
E=list(input())+[""]
for o,e in zip(O,E):
	print(o+e,end="")

Submission status: Accepted

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

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[-1])

Submission status: Accepted

Solution code:
O = input()
E = 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 = str(input())
e = str(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:
O=list(input())
E=list(input())
password=[]

for i in range(len(O)):
    password.append(O[i])
    try:
        password.append(E[i])
    except:
        None

print(''.join(password))

Submission status: Accepted

Solution code:
a=input()
b=input()
ans=[]
if len(a)==len(b):
    for i in range(len(a)):
        ans.append(a[i])
        ans.append(b[i])
else:
    for i in range(len(b)):
        ans.append(a[i])
        ans.append(b[i])
    ans.append(a[len(a)-1])
print(''.join(ans))

Submission status: Accepted

Solution code:
o = input()
e = input()
olst = list(o)
for i in range(len(o)):
    if i < len(e):
        olst.insert(2 * i + 1, e[i])
print(''.join(olst))