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:
A=input()
B=input()
A=list(A)
B=list(B)

V=""
if len(A)-len(B)==0:
    for i in range(len(A)):
        V +=A[i]+B[i]
    print(V)
else:
    for i in range(len(B)):
        V +=A[i]+B[i]
    print(V+A[len(A)-1])

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

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
from fractions import gcd
import bisect
 
stdin = sys.stdin
 
ns = lambda: stdin.readline().rstrip()
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
s = lambda h: [list(map(int, stdin.readline().split())) for i in range(h)]

o = ns()
e = ns()
if len(o) - len(e) == 0:
        for oi, ei in zip(o, e):
                print(oi + ei, end='')
else:
        for oi, ei in zip(o[:-1], e):
                print(oi + ei, end='')
        print(o[-1], end='')

Submission status: Accepted

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

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

Submission status: Accepted

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

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 = list(input())
e = list(input())+['']

for i in range( len(o) ) :
  print(o[i]+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= 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 = []
if len(o) == len(e):
    for i in range(len(e)):
        ans.append(o[i])
        ans.append(e[i])
else:
    ans.append(o[0])
    for i in range(len(e)):
        ans.append(e[i])
        ans.append(o[i+1])

print(''.join(ans))

Submission status: Accepted

Solution code:
a=list(input())
b=list(input())+[""]
for x,y in zip(a,b):
  print(x+y,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 = list(input())
E = list(input()) + ['']

for x, y in zip(O, E) :
    print(x+y, end="")

print('')

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
import copy
import collections
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush, heapify
import math
import itertools
import random
 
# NO, PAY-PAY
#import numpy as np
#import statistics
#from statistics import mean, median,variance,stdev
 
INF = float('inf')
def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
 
def main():
    O = input()
    E = input()
    
    tmp = len(E)
    ind = 0
    
    ans = ""
    for i,val in enumerate(O):
        ans += val
        ind = i
        if tmp > i:
            ans += E[i]
        
    print(ans)
    
    
if __name__ == "__main__":
	main()

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
input=sys.stdin.readline

o = input().strip()
e = input().strip()
ans = ""
for i,c in enumerate(o):
    ans += c
    if i < len(e):
        ans += e[i]
print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# 文字列の結合。互い違い
# for をlen(O)で回る
o = input()
e = input()
for i in range(min(len(o),len(e))):
  print(o[i]+e[i],end="")
if len(o) > len(e):
  print(o[-1])
elif len(o) < len(e):
  print(e[-1])
else:
  pass

Submission status: Accepted

Solution code:
o,e=map(str,open(0).read().split())
for i in range(len(o)):
  print(o[i],end="")
  if i==len(o)-1 and len(o)>len(e):
    break
  else:
    print(e[i],end="")

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

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())
pw=[]
if len(o)-len(e)==0:
  for i in range(len(o)):
    pw.append(o[i]+e[i])
else:
  for i in range(len(o)-1):
    pw.append(o[i]+e[i])
  pw.append(o[len(o)-1])
print(*pw,sep='')

Submission status: Accepted

Solution code:
O = list(input())
E = list(input())
ans = ""
while O or E:
  try:
    ans += O.pop(0)
    ans += E.pop(0)
  except IndexError:
    pass
print(ans)

Submission status: Accepted

Solution code:
o = list(input())
e = list(input())
r = ''
for x in range(len(e)):
    r = r + o[x] + e[x]
if len(o) != len(e):
    r = r + o[-1]

print(r)

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

for letter in range(len(o)-1):
    print(o[letter], end="")
    print(e[letter], end="")

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
O = input()
E = input()
password = []
if (len(O)+len(E))%2 != 0:
    for i in range(len(O)):
        password.append(O[i])
        if i == (len(O)-1): break
        password.append(E[i])
else:
    for i in range(len(E)):
        password.append(O[i])
        password.append(E[i])


print(*password, sep='')

Submission status: Accepted

Solution code:

o = input() + ' '
e = input() + ' '
x = list(map(lambda a,b: (a+b), o, e))
x = ''.join(x)
print(x.strip())

Submission status: Accepted

Solution code:
o = list(input())
e = list(input()) + [""] #+[""]をつけないと、len(o)>len(e)の場合に困る
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 i < len(o) - 1 or len(e) == len(o):
    ans.append(e[i])
print("".join(ans))

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 = list(input())
E = list(input())

ans = O[:]
for i in range(len(O)):
    try:
        ans.insert(2*i+1, E[i])
    except:
        break
print("".join(ans))

Submission status: Accepted

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

Olen = len(O)
Elen = len(E)

s = ""
for i in range( max(Olen, Elen) ):
    oc = O[i] if i < Olen else ""
    ec = E[i] if i < Elen else ""
    s += oc+ec

print(s)

Submission status: Accepted

Solution code:
o, e = [input() for _ in range(2)]
print(''.join(x+y for x, y in zip(o, e+" ")))

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

Solution code:
o = input()
e = input()
print(''.join(a+b for a, b in zip(o, e)), end='')
print(o[-1] if len(o) > len(e) else '')

Submission status: Accepted

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

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()+' '
for x,y in zip(o,e): print(x+y,end='')

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
o=input()
e=input()
l=[o[i]+e[i] for i in range(len(e))]
if len(o)>len(e):
    l.append(o[-1])
print(*l,sep='')

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()
o=input()
e=input()
print(''.join(o[i]+e[i:i+1] for i in range(len(o))))

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=list(input())
E=list(input())+[""]
for o,e in zip(O,E): print(o+e,end="")

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 = list(input())
e = list(input()) + [""]
for a,b in zip(o,e):
    print(a+b,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 = list(input())
e = list(input())+[""]
for i, j in zip(o, e):
    print(i+j, 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:
O = input()
E = input()

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


print(*arr, sep='')

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

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()
s = ""
for i in range(len(o)):
    s += o[i]
    if i < len(e):
        s += e[i]
print(s)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline


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

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

Submission status: Accepted

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

if len(O)==len(E)+1:
    E+=" "
    ans=""
    for o, e in zip(O, E):
        ans+=o
        ans+=e
    print(ans[:-1])
else:
    ans=""
    for o, e in zip(O, E):
        ans+=o
        ans+=e
    print(ans)

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

Submission status: Accepted

Solution code:
o = input()
e = input()+" "
# print(s)
for i, j in zip(o, e):
    print(i+j, 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:
I=input
for i,j in zip(I(),I()+" "):print(i+j,end="")

Submission status: Accepted

Solution code:
O = input()
E = input()
tmp = max(len(O), len(E))
ans = ''
for i in range(tmp):
    if len(O) - 1 >= i and len(E) - 1 >= i:
        ans += O[i] + E[i]
    elif len(O) - 1 < i and len(E) - 1 >= i:
        ans += E[i]
    elif len(O) -1 >= i and len(E) - 1 < i:
        ans += O[i]

print(ans)

Submission status: Accepted

Solution code:
a=input()
b=input()
s=""
for i in range(len(b)):
	s+=a[i]+b[i]
if len(a)!=len(b):
	s+=a[-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()

password = ''

for i in range(len(o)):
    password += o[i]
    if (len(o) > len(e)) and ((len(o) - 1) == i):
        break
    password += e[i]


print(password)

Submission status: Accepted

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

ans_str = ''
for o_one, e_one in zip(o, e):
    ans_str = ans_str + o_one + e_one

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

print(ans_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:
O = input()
E = input()
ans = ""
cnt = 0
for o,e in zip(O,E):
    cnt+=1
    ans += o
    ans += e
if len(O) != len(E):
    ans += O[-1]
print(ans)

Submission status: Accepted

Solution code:
O = input()
E = input()
count = 1
while count <= len(O)+len(E):
    if count % 2 == 1:
        print(O[count//2],end="")
    else:
        print(E[count//2-1],end="")
    count += 1

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

Submission status: Accepted

Solution code:
O = input()
E = input()
len_o = len(O)
len_e = len(E)
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:
# -*- coding: utf-8 -*-


if __name__ == '__main__':
    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()
result = []
if len(o) == len(e):
    for i in range(len(o)):
        result.append(o[i]+e[i])
else:
    for i in range(len(o)-1):
        result.append(o[i]+e[i])
    result.append(o[-1])
print(''.join(result))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
pw=[input() for i in range(2)]
length=len(pw[0])
full_pw=[]
i=0
while i < length:
    full_pw.append(pw[0][i])
    if i <=len(pw[1])-1:
        full_pw.append(pw[1][i])
    i+=1

print(*full_pw,sep='')

Submission status: Accepted

Solution code:
from itertools import zip_longest

o = input()
e = input()

for x,y in zip_longest(o, e, fillvalue=""):
  print(x+y,end="")

Submission status: Accepted

Solution code:
o = input()
e = input()
s = ''
for i in range(len(o)):
  s += o[i]
  if i + 1 > len(e): #　最後の文字の判定、もっといい方法あるはず
    break
  s += e[i]
print(s)

Submission status: Accepted

Solution code:

S1 = []
S2 = []
S1 = input()
S2 = input()

nL1 = len(S1)
nL2 = len(S2)

nN = nL1 + nL2

for i in range(nN):
  nFlag = i
  nFlag &= 1
  if i == 0:
    nTmp = 0
  else:
    nTmp = i // 2
  if nFlag == 0:
    print(S1[nTmp], end='')
  else:
    print(S2[nTmp], end='')

print('')

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

Submission status: Accepted

Solution code:
def main():
    O = input()
    E = input()
    if len(O) - len(E) == 0:
        ans = ''
        for o, e in zip(O, E):
            ans += o + e
    else:
        ans = O[0]
        for o, e in zip(O[1:], E):
            ans += e + o
    print(ans)


main()

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys, math, fractions, itertools


def solve(O: str, E: str):
    A = [''] * (len(O) + len(E))
    for i in range(len(A)):
        if i % 2 == 0:
            A[i] = O[i//2]
        else:
            A[i] = E[(i-1)//2]
    print(''.join(A))
    return


# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
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().rstrip('\n')
E = input()
ans = ""
for i in range(len(E)):
    ans += O[i]
    ans += E[i]

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

Submission status: Accepted

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

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

if (len(O) != l):
    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(o)):
    x.append(o[i]+e[i])
else:
  for i in range(len(e)):
    x.append(o[i]+e[i])
  x.append(o[-1])
print(*x,sep="")

Submission status: Accepted

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

Submission status: Accepted

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

ans = ""

N = len(O)+len(E)

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

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

Submission status: Accepted

Solution code:
def main():
    o=list(input())
    e=list(input())
    ans = ''
    for i,j in zip(o,e):
        ans += i
        ans += j
    if len(o)-len(e) == 1:
        ans += o[-1]
    print(ans)
if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
O=input()
E=input()
li=[]
for i in range(len(O)):
  li.append(O[i])
  try:
    li.append(E[i])
  except:
    continue
print("".join(li))

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()
s = ""
for i in range(len(e)):
  s += o[i]
  s += e[i]
if len(o) > len(e):
  s += o[-1]
print(s)

Submission status: Accepted

Solution code:
o = input()
e = input()
li = "".join([i+j for (i,j) in zip(o,e)])
if len(o) == len(e):
    print(li)
elif len(o) > len(e):
    print(li + o[-1])
else:
    print(li + e[-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]+e[i]
else:
    for i in range(len(o)-1):
        s += o[i]+e[i]
    s += o[-1]
print(s)

Submission status: Accepted

Solution code:
a = list(input())
b = list(input())
ans = []
if len(a) == len(b):
    for i in range(len(a)):
        ans.append(a[i])
        ans.append(b[i])
elif len(a) > len(b):
    for i in range(len(b)):
        ans.append(a[i])
        ans.append(b[i])
    ans.append(a[-1])

print(''.join(ans))

Submission status: Accepted

Solution code:
#ABC 58, B - dot dot dot
O = input()
E = input()

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

Submission status: Accepted

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

for s,t in zip(O,E):
  z+=s
  z+=t
  
if len(E)<len(O):
  z+=O[-1]

print(z)

Submission status: Accepted

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

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

print(s)

Submission status: Accepted

Solution code:
odd = input()
even = input()
ans = ''
for i in range(0, len(odd)):
	ans = ans + odd[i]
	if i != len(even):
		ans = ans + even[i]
print(ans)

Submission status: Accepted

Solution code:
a = input()
b = input()
ans = ""
count = 0
while True:
  if count == len(a):
    print(ans)
    exit()
  ans += a[count]
  if count == len(b):
    print(ans)
    exit()
  ans += b[count]
  count += 1

Submission status: Accepted

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

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

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

print(out)

Submission status: Accepted

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

for i in range(len(o)+len(e)):
  if i%2==0:
    out += o[int(i/2)]
  elif i%2!=0:
    out += e[int(i/2)]

print(out)

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()
print(''.join([a + b for a, b in zip(o, e)]) + (o[-1] * (len(o + e) % 2)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')

#A
def A():
    a, b, c = LI()
    if b - a == c - b:
        print("YES")
    else:
        print("NO")
    return

#B
def B():
    o = S()
    e = S()
    for i in range(len(e)):
        print(o[i] + e[i], end="")
    if len(e) != len(o):
        print(o[-1], end="")
    print()
    return

#C
def C():
    return

#D
def D():
    return

#Solve
if __name__ == '__main__':
    B()

Submission status: Accepted

Solution code:

from collections import defaultdict, Counter

def main():
    a = list(input())
    b = list(input())

    for i in range(len(a)):
        print(a[i], end='')
        if i == len(b):
            continue
        print(b[i], end='')
    print()


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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],end="")

Submission status: Accepted

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

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

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

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

    print("".join(pw))

    # if len(o) == len(e):
    #     pw = [o[i]+e[i] for i in range(len(o))]
    # else:
    #     pw = [o[i]+e[i] for i in range(len(e))]
    #     pw.append(o[-1])
    # 
    # print("".join(pw))
    # 


if __name__ == "__main__":

    main()

Submission status: Accepted

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

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

    print("".join(pw))


if __name__ == "__main__":

    main()

Submission status: Accepted

Solution code:
O = list(input())
E = list(input())
res = ''
iter = 0
while len(O) != 0 or len(E) != 0:
    if len(O) > 0:
        res += O.pop(0)
    if len(E) > 0:
        res += E.pop(0)
    iter += 1
print(res)

Submission status: Accepted

Solution code:
o=input()
e=input()
s=[0]*(len(o)+len(e))
for i in range(len(o)):s[2*i]=o[i]
for i in range(len(e)):s[2*i+1]=e[i]
print(*s,sep='')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

ans = ""

for i in range(len(o)):
    ans += o[i]
    try:
        ans += e[i]
    except:
        break

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
s2 = input()
ans = ""
for i in range(0,max(len(s),len(s2))):
  if i < len(s):
    ans += s[i]
  if i < len(s2):
    ans += s2[i]
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s_o = input()
s_e = input()
ans = ''
for i in range(len(s_o) + len(s_e)):
    ans += s_o[i // 2] if i % 2 == 0 else s_e[i // 2]
print(ans)

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:
o=str(input())
e=str(input())
l=[]
for i in range(len(e)):
    l.append(o[i])
    l.append(e[i])
if len(o)>len(e):
    l.append(o[-1])
print("".join(l))

Submission status: Accepted

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

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

Submission status: Accepted

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

def main(O, E):
    A = []
    if(len(O)==len(E)):
        for i in range(len(O)):
            A.append(O[i])
            A.append(E[i])
        print("".join(A))
    else:
        for i in range(len(E)):
            A.append(O[i])
            A.append(E[i])
        A.append(O[-1])
        print("".join(A))  
    
if __name__ == '__main__':
    O = input()
    E = input()
    
    main(O, E)

Submission status: Accepted

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

o = input()
e = input()

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

Submission status: Accepted

Solution code:

O = input()
E = input()

ans = ""
o = 0
e = 0

for i in range(len(O)+len(E)):

    if i % 2 == 0:

        ans += O[o]
        o += 1

    else:

        ans += E[e]
        e += 1

print (ans)

Submission status: Accepted

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

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)