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:
odd = list(input())
even = list(input())
ans = ''
if len(odd) == len(even):
  for i in range(len(odd)):
    ans += odd[i]
    ans += even[i]
else:
  for i in range(len(even)):
    ans += odd[i]
    ans += even[i]
  ans += odd[len(odd)-1]
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(a)

Submission status: Accepted

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

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

Submission status: Accepted

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

while True:
    if len(O) == 0 and len(E) == 0:
        break;
    if len(O) > 0:
        password.append(O.pop(0))
    if len(E) > 0:
        password.append(E.pop(0))

print("".join(password))

Submission status: Accepted

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

while True:
    if len(O) == 0 and len(E) == 0:
        break;
    if len(O) > 0:
        password.append(O.pop(0))
    if len(E) > 0:
        password.append(E.pop(0))

print("".join(password))

Submission status: Accepted

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

ans = ""

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

print(ans[4:-4])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from math import floor
a = input()
b = input()
c = ""

for i in range(len(a)+len(b)):
  if i%2==0:
    c+=a[floor(0.5*i)]
  else:
    c+=b[floor(0.5*i)]
else:
  print(c)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(300000)


def solve(O: str, E: str):
    ret = [None] * (len(O) + len(E))
    for i in range(len(O)):
        ret[i * 2] = O[i]
    for i in range(len(E)):
        ret[i * 2 + 1] = E[i]
    print(''.join(ret))
    return


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    O = next(tokens)  # type: str
    E = next(tokens)  # type: str
    solve(O, E)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

lo = len(o)
le = len(e)

ans = ''

if lo != le:
    e += '/'

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

if lo == le:
    print(ans)
else:
    print(ans[:-1])

Submission status: Accepted

Solution code:
from sys import stdin
O,E = map(lambda x: [x2 for x2 in x],stdin.read().splitlines())
if len(O) - len(E) == 1:
  E.append("")
print("".join([o+e for o,e in zip(O,E)]))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
O = list(input())
E = list(input())
i = 1
for x in E:
  O.insert(i,x)
  i+=2
print(''.join(O))

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 = input()
E = input()
P = ""
for i in range(min(len(O),len(E))):
  if O[i] == "":
    break
  else:
    P = P+O[i]
  if E[i] == "":
    break
  else:
    P = P+E[i]
if len(O)-len(E) == 1:
  P = P+O[-1]
elif len(E)-len(O) == 1:
  P = P+E[-1]
else:
  P = P
print(P)

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
O, E = list(input()), list(input())
mrg = []

for i in range(len(E)):
    mrg.append(O[i])
    mrg.append(E[i])
    
if len(O) > len(E):
    mrg.append(O[-1])
    
for j in range(len(mrg)):
    print(mrg[j], end = "")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
odd = input()
even = input()
for i in range(len(even)):
  print(odd[i],end="")
  print(even[i],end="")
if len(odd) > len(even):
  print(odd[-1])

Submission status: Accepted

Solution code:
# B問題
O = input()
E = 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[len(O) - 1]
print(ans)

Submission status: Accepted

Solution code:
nl = lambda: list(map(int, input().split()))
sl = lambda: input().split()
n = lambda: int(input())
s = lambda: input()

O = s()
E = s()

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
o = input().rstrip()
e = input().rstrip()
 
ans = ''
for l1, l2 in zip(o, e):
  ans = ''.join([ans, l1, l2])
 
if len(o) > len(e):
  ans += o[-1]
 
print(ans)

Submission status: Accepted

Solution code:
o = list(str(input()))
e = list(str(input()))
l = []
for i in range(len(o)) :
    l.append(o[i])
    if i < len(e) :
        l.append(e[i])
print(''.join(l))

Submission status: Accepted

Solution code:
def abc():
    o = list(input().rstrip())
    e = list(input().rstrip())
    if len(o) > len(e):
        e.append('')
    password = ''
    for _o, _e in zip(o, e):
        password += _o + _e
    print(password)


abc()

Submission status: Accepted

Solution code:
O=input()
E=input()
OE=[O,E]
password=""
for idx in range(len(O)+len(E)):
    password+=(OE[idx % 2][int(idx/2)])
print(password)

Submission status: Accepted

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

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:
import bisect
import os
from collections import Counter, deque
from fractions import gcd
from functools import lru_cache
from functools import reduce
import functools
import heapq
import itertools
import math
import numpy as np
import re
import sys
import string

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")

sys.setrecursionlimit(2147483647)
INF = float("inf")


import bisect
import os
from collections import Counter, deque
from fractions import gcd
from functools import lru_cache
from functools import reduce
import functools
import heapq
import itertools
import math
import numpy as np
import re
import sys
import string

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")

sys.setrecursionlimit(2147483647)
INF = float("inf")

#
# A, B, C = list(map(int, sys.stdin.readline().split()))
# a = A
# ok = False
# for _ in range(1000):
#     ok |= a % B == C
#     a += A
# if ok:
#     print('YES')
# else:
#     print('NO')
#
#
# A, B = [int(sys.stdin.readline()) for _ in range(2)]
# if A>B:
#     print('GREATER')
# elif A<B:
#     print('LESS')
# else:
#     print('EQUAL')


O, E = [sys.stdin.readline().rstrip() for _ in range(2)]
ans = ''
for i in range(len(O)):
    ans += O[i]
    if i < len(E):
        ans += E[i]

print(ans)



#
# N, M = list(map(int, sys.stdin.readline().split()))
# A, B = list(zip(*[map(int, sys.stdin.readline().split()) for _ in range(N)]))
# C, D = list(zip(*[map(int, sys.stdin.readline().split()) for _ in range(M)]))
#
# O, E = [sys.stdin.readline().rstrip() for _ in range(2)]
# ans = ''
# for i in range(len(O)):
#     ans += O[i]
#     ans += E[i]
#
# print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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="")
    print(O[i+1])
elif len(O) < len(E):
    for i in range(len(O)):
        print(E[i],end="")
        print(O[i],end="")
    print(O[i+1])
else:
    for i in range(len(O)):
        print(O[i],end="")
        print(E[i],end="")

Submission status: Accepted

Solution code:
o=input()
e=input()
ans=''
if len(o)-len(e)==1:
    o1=o[-1]
    o=o[:-1]
else:
    o1=''

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

print(ans)

Submission status: Accepted

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

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

if len(a)>len(b):
    print(a[len(a)-1])
elif len(a)<len(b):
    print(b[len(b)-1])

Submission status: Accepted

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

answer = ""
for i in range(len(O)) :
    if (len(O) > len(E)) and ((i+1) == len(O)) :
        answer += O[i]
    else :
        answer += O[i]
        answer += E[i]

print(answer)

Submission status: Accepted

Solution code:
o = input()
e = input()
if len(o) == len(e):
    for i,j in zip(o,e):
        print(i + j, end='')
else:
    print(o[0], end='')
    for i, j in zip(o[1:],e):
        print(j+i, end='')

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) == 1:
    ans += o[-1]
print(ans)

Submission status: Accepted

Solution code:
from itertools import zip_longest

o = input()
e = input()
ans = ""
for i,j in zip_longest(o,e,fillvalue=""):
  ans += i
  ans += j
print(ans)

Submission status: Accepted

Solution code:
O = input()
E = input()
ans = []
cnt = 0

for i in range(len(O) + len(E)):
    if i == 0 or i % 2 == 0:
        ans.append(O[cnt])
    else:
        ans.append(E[cnt])
        cnt += 1

print(''.join(ans))

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)==1:
        ans=ans+o[-1]

print(ans)

Submission status: Accepted

Solution code:
S = input()
T = input()

answer = ''
for s,t in zip(S,T):
  answer += s
  answer += t
  
if len(S) > len(T):
  answer += S[-1]

print(answer)

Submission status: Accepted

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

print(ans+o[l:]+e[l:])

Submission status: Accepted

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

Submission status: Accepted

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

s = []
if len(O)>len(E):
  for a,b in zip(O[:-1],E):
    s.append(a)
    s.append(b)
  s.append(O[-1])
else:
  for a,b in zip(O,E):
    s.append(a)
    s.append(b)

print(''.join(s))

Submission status: Accepted

Solution code:
o=list(input())
e=list(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:
# -*- coding: utf-8 -*-

o = input()
e = input()

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

Submission status: Accepted

Solution code:
O = list(input())
E = list(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:
slist = [input(), input()]
ans = ''
for i in range(0, len(slist[0])+len(slist[1])):
	if i%2 == 0: ans = ans + slist[0][i//2]
	else: ans = ans + slist[1][i//2]
print(ans)

Submission status: Accepted

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

for i,j in enumerate(e):
    o.insert(1+2*i,j)
print("".join(o))

Submission status: Accepted

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

answer = []
for o, e in zip(O.copy(), E.copy()):
  answer.append(o)
  answer.append(e)
  O.pop(0)
  E.pop(0)

if len(O) == 0 and len(E) == 0:
  print(''.join(answer))
else: 
  answer.append(O[0])
  print(''.join(answer))

Submission status: Accepted

Solution code:
O  = list(input())
E = list(input())
ans = []
size_o = len(O)
size_e = len(E)

if size_o - size_e == 0 :
    for i in range(size_o):
        ans.append(O[i])
        ans.append(E[i])
    print("{}".format("".join(ans)))
else :
    for i in range(size_e):
        ans.append(O[i])
        ans.append(E[i])
    ans.append(O[-1])
    print("{}".format("".join(ans)))

Submission status: Accepted

Solution code:
from sys import stdin
from itertools import zip_longest
O = (stdin.readline().rstrip())
E = (stdin.readline().rstrip())
ans=""
for i,j in zip_longest(list(O),list(E),fillvalue=""):
    ans = ans + i + j
print(ans)

Submission status: Accepted

Solution code:
a=input()
b=input()
l1=len(a)
l2=len(b)
if l1==l2:
  for i in range(l1):
    print(a[i]+b[i],end="")
else:
  for i in range(l2):
    print(a[i]+b[i],end="")
  print(a[-1])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
O=input()
E=input()
s=[]
for i in range(len(E)):
    s.append(O[i])
    s.append(E[i])
if len(O)>len(E):
    s.append(O[len(E)])    
print("".join(s))

Submission status: Accepted

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

l = len(O)
L = len(E)
s = ''

if l == L:
    for i in range(l):
        s = s + O[i] + E[i]
    print(s)
else:
    for i in range(L):
        s = s + O[i] + E[i]
    s += O[-1]
    print(s)

Submission status: Accepted

Solution code:
# 2019/05/30
# AtCoder Beginner Contest 058 - B

# Input
o = input()
e = input()
str = ""

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

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

# Output
print(str)

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

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

    ans = ""
    for i in range(len(O)):
        ans += O[i]
        if i >= len(E):
            continue
        ans += E[i]
    
    print(ans)

if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
O = input()
E = input()
length = len(O)+len(E)
ans = [""]*length

for i in range(length):
    if i%2 == 0:
        ans[i] = O[i//2]
    else:
        ans[i] = E[i//2]
        
ans = "".join(ans)
print(ans)

Submission status: Accepted

Solution code:
o = input()
e = input()
ans = []
for i in range(len(e)):
    ans.append(o[i]+e[i])
if len(o) > len(e):
    ans.append(o[len(o)-1])
print("".join(ans))

Submission status: Accepted

Solution code:
o = list(input())
e = list(input())
z = int(max(len(o),len(e)))
for i in range(z):
    if o[i:i+1]:
        print(o[i],sep='',end='')
    if e[i:i+1]:
        print(e[i],sep='',end='')
print('')

Submission status: Accepted

Solution code:
s1 = input()
s2 = input()

ans = ""
for i in range(len(s1)+len(s2)):
  if i % 2 == 0:
    ans += s1[i//2]
  else:
    ans += s2[i//2]
print(ans)

Submission status: Accepted

Solution code:
odd = input()
even = input()
password = ""
o_index = 0
e_index = 0

while True:
	if not o_index == len(odd):
		password+= odd[o_index]
		o_index+=1

	if not e_index == len(even):
		password+= even[e_index]
		e_index+=1
	
	else:
		break

	
print(password)

Submission status: Accepted

Solution code:
odd = input()
even =input()
odd_list = []
even_list = []

for i in odd:
    odd_list.append(i)
for j in even:
    even_list.append(j)
even_list.append("")

for i in range(len(odd_list)):
    print(odd_list[i],end = "")
    print(even_list[i],end = "")

Submission status: Accepted

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

tail = len(O) - len(E)

print("".join((x + y for x, y in zip([O, O[:-1]][tail], E))) + ["", O[-1]][tail])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
O, E = input(), input() + " "
print("".join(o + e for o, e in zip(O, E)))

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+O[-1])
else:
    print(ans)

Submission status: Accepted

Solution code:
o = input()
e = input()
oe = "".join([i + j for i, j in zip(o,e+"\n")])
print(oe)

Submission status: Accepted

Solution code:
import itertools

O = input()
E = input()

for o, e in itertools.zip_longest(O, E):
    print(o, sep='', end='')
    if e is not None:
        print(e, sep='', end='')
print()

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=list(input())
e=list(input())
re=""
if len(o)==len(e):
    for i in range(len(o)):
        o[i]+=e[i]
    for j in range(len(o)):
        re+=o[j]
    print(re)
elif len(o)>len(e):
    for i in range(len(o)-1):
        o[i]+=e[i]
    for j in range(len(o)):
        re+=o[j]
    print(re)
else:
    for i in range(len(o)):
        o[i]+=e[i]
    for j in range(len(o)):
        re+=o[j]
    re+=e[len(e)-1]
    print(re)

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().strip()
e = input().strip()
for i, c in enumerate(o):
    print(c, end='')
    if i < len(e):
        print(e[i], end='')

print()

Submission status: Accepted

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

passwd = "".join([O[i] + E[i] for i in range(min(len(O), len(E)))])
if len(O) > len(E):
    passwd += O[-1]
print(passwd)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print(''.join([o+e for o,e in zip(input(), input()+'\n')]))

Submission status: Accepted

Solution code:
# encoding:utf-8
import copy
import random
import bisect #bisect_left　これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math

mod = 10**9+7

O = str(input())
E = str(input())

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

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

print(ans)

Submission status: Accepted

Solution code:
from sys import stdin
O = list(stdin.readline().rstrip())
E = list(stdin.readline().rstrip())
ans = []
diff = len(O)-len(E)
for o, e in zip(O, E):
    ans.append(o+e)
if diff == 1:
    ans.append(O[-1])
elif diff == -1:
    ans.append(E[-1])
print(''.join(ans))

Submission status: Accepted

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

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

if O < E:print(e[-1])
elif O > E:print(o[-1])
else:print()

Submission status: Accepted

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


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

print(string)

Submission status: Accepted

Solution code:
o=str(input())
e=str(input())
ans=""
i=0
while len(ans)<len(o)+len(e):
    ans+=o[i]
    if i<len(e):
        ans+=e[i]
    i+=1
 
print(ans)

Submission status: Accepted

Solution code:
o=str(input())
e=str(input())
ans=""
i=0
while len(ans)<len(o)+len(e):
    ans+=o[i]
    if i<len(e):
        ans+=e[i]
    i+=1

print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
O=list(input())
E=list(input())
S=[]
if len(O)>len(E):
    for i in range(len(E)):
        S.append(O[i])
        S.append(E[i])
    S.append(O[-1])
else:
    for i in range(len(E)):
        S.append(O[i])
        S.append(E[i])
print(''.join(S))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
o = str(input())
e = str(input())
l = []
if len(o) == len(e):
    for i in range(len(o)):
        l.append(o[i]+e[i])
    print("".join(l))
else:
    for i in range(len(e)):
        l.append(o[i]+e[i])
    print("".join(l)+o[-1])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
###
### atcorder test program
###

import sys

### math class
class math:
    ### pi
    pi = 3.14159265358979323846264338

    ### GCD
    def gcd(self, a, b):
        if b == 0:
            return a
        return self.gcd(b, a%b)

    ### LCM
    def lcm(self, a, b):
        return (a*b)//self.gcd(a,b)

    ### Prime number search
    def Pnum(self, a):
        if a == 1: return False
        for i in range(2,int(a**0.5)+1):
            if a % i == 0:
                return False
        return True

    ### Circle area
    def caria(self, r):
        return r*r*self.pi

math = math()

### output class
class output:
    ### list
    def list(self, l):
        l = list(l)
        print(" ", end="")
        for i, num in enumerate(l):
            print(num, end="")
            if i != len(l)-1:
                print(" ", end="")
        print()

output = output()

### input sample
#i = input()
#A, B, C = [x for x in input().split()]
#inlist = [int(w) for w in input().split()]
#R = float(input())
#A = [int(x) for x in input().split()]
#for line in sys.stdin.readlines():
#    x, y = [int(temp) for temp in line.split()]

### output sample
#print("{0} {1} {2:.5f}".format(A//B, A%B, A/B))
#print("{0:.6f} {1:.6f}".format(R*R*math.pi,R*2*math.pi))
#print(" {}".format(i), end="")

#A, B, C = [int(x) for x in input().split()]

O = input()
E = input()

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

Submission status: Accepted

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

flg = 0
N = max(len(O), len(E))
if len(O) > len(E):
  flg = 1

ans = ''
if flg:
  for i in range(N):
    if i == N-1:
      ans += O[i]
    else:
      ans += O[i] + E[i]
else:
  for i in range(N):
    ans += O[i] +E[i]
print(ans)

Submission status: Accepted

Solution code:
A=input()
B=input()

C=[]
for i in range(len(A)):
    C.append(A[i])
    if len(B)-1 >= i:
        C.append(B[i])
print("".join(C))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
O,E = input(),input()
ans = ""
for i,e in enumerate(E):
    ans += O[i]+e
if len(O)>len(E):
    ans += O[-1]
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
o = [c  for c in input()]
e = [c  for c in input()]

j = 0
for i in range(len(o)):
    e.insert(j, o[i])
    j = j + 2

print(''.join(e))

Submission status: Accepted

Solution code:
# 入力
O=list(input())
E=list(input())

s=''
while True:
  # 各文字列両方とも空になったら終了
  if len(O)==0 and len(E)==0:
    break

  if len(O)!=0:
    s+=O[0]
    O.remove(O[0])

  if len(E)!=0:
    s+=E[0]
    E.remove(E[0])

# 出力
print(s)

Submission status: Accepted

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

while True:
	if len(o) == 0 and len(e) == 0:
		break
		
	if len(o) != 0:
		ans = ans + o[0]
		o.remove(o[0])
	if len(e) != 0:
		ans = ans + e[0]
		e.remove(e[0])
print(ans)

Submission status: Accepted

Solution code:
O, Q = list(input()), list(input()) + [""]
for i, j in zip(O, Q):
    print(i+j, end="")

Submission status: Accepted

Solution code:
o = list(input())
e = list(input())
psw = ['0']*(len(o)+len(e))

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

print(*psw, sep='')

Submission status: Accepted

Solution code:
# 入力
O=list(input())
E=list(input())

s=''
while True:
    # 各文字列両方とも空になったら終章
    if len(O)==0 and len(E)==0:
        break

    if len(O)!=0:
        s+=O[0]
        O.remove(O[0])

    if len(E)!=0:
        s+=E[0]
        E.remove(E[0])

# 出力
print(s)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
O = input()
E = 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=input()
e=input()
t=[]
for i in range(1,len(o)+len(e)+1):
    if i%2==1:
        t.append(o[i//2])
    else:
        t.append(e[i//2-1])
print(''.join(t))

Submission status: Accepted

Solution code:
o=input()
e=input()
a,b=len(o),len(e)
if a==b:
    print("".join([o[i]+e[i] for i in range(a)]))
elif a>b:
    print("".join([o[i]+e[i] for i in range(b)])+o[-1])
else:
    print("".join([o[i]+e[i] for i in range(a)])+e[-1])

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

print(ans)

Submission status: Accepted

Solution code:
O = input()
E = input()
print(('{}'.join(O)+'{}'*(len(O)==len(E))).format(*E))

Submission status: Accepted

Solution code:
odd = list(input())
even = list(input()) + [""]
s = ""
for o, e in zip(odd, even):
  s += (o + e)
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:
#58
a = input()
b = input()

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
O = input()
E = input()
P = []
for i in range(1, len(O) + len(E) + 1):
    if i % 2 == 0:
        P.append(E[i // 2 - 1])
    else:
        P.append(O[i // 2])
print(''.join(P))

Submission status: Accepted

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

for o,e in zip(O,E):
    print(o+e, end='')
if len(O) > len(E):
    print(O[-1])

Submission status: Accepted

Solution code:
O = input()
E = input()
l = len(O)+len(E)

o = ""
for i in range(l):
    o += [O,E][i%2][i//2]

print(o)

Submission status: Accepted

Solution code:


o = list(str(input()))
e = list(str(input()))
i = 1
while len(o)>0 or len(e)>0:
  if i%2==1:
    print(o[0],end="")
    o = o[1:]
  else:
    print(e[0],end="")
    e = e[1:]
  i+=1
print()

Submission status: Accepted

Solution code:
# ABC058B - ∵∴∵
o, e = [list(input().rstrip()) for _ in range(2)]
ans = []
for i in range(min(len(o), 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 = input()
e = input()
ans = ""
if not len(e) == len(o):
    e += " "
for s, t in zip(o, e):
    ans += s + t
ans = ans.strip()
print(ans)

Submission status: Accepted

Solution code:
import sys
from collections import Counter

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

for i in range(len(o)):
    ans.append(o[i])
    try:
        ans.append(e[i])
    except IndexError:
        pass

print(''.join(ans))

Submission status: Accepted

Solution code:
S1 = input()
S2 = input()
ans = ""
for i, j in zip(S1, S2):
  ans += i + j

if len(S1) > len(S2):
  ans += S1[-1]
elif len(S1) < len(S2):
  ans += S2[-1]
print(ans)