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:
from statistics import mean, median,variance,stdev
import numpy as np
import sys
import math
import fractions
import itertools
import copy

def j(q):
    if q==1: print("YES")
    else:print("NO")
    exit(0)


def ct(x,y):
    if (x>y):print("GREATER")
    elif (x<y): print("LESS")
    else: print("EQUAL")

def ip():
    return int(input())


#n = ip()                              #入力整数1つ
#n,m= (int(i) for i in input().split())      #入力整数横2つ
#a,b,c = (int(i) for i in input().split())    #入力整数横3つ
#n,a,b,c= (int(i) for i in input().split())  #入力整数横4つ
#a = [int(i) for i in input().split()]        #入力整数配列
a = input()                                  #入力文字列
#a = input().split()                          #入力文字配列
#n = ip()                      #入力セット(整数改行あり)(1/2)
#a=[ip() for i in range(n)]    #入力セット(整数改行あり)(2/2)
#a=[input() for i in range(h)]
#jの変数はしようできないので注意
#全足しにsum変数使用はsum関数使用できないので注意
b = input()
for i in range(len(a)):
    print(a[i],end='')
    if i == len(b):break
    print(b[i],end='')

Submission status: Accepted

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

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

Submission status: Accepted

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

res = ''
o,e = 0,0
for i in range(len(O+E)):
    if i % 2 == 0:
        res += O[o]
        o +=1
    else:
        res += E[e]
        e += 1

print(res)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
o = input()
e = input()
z = []
if len(o) == len(e):
	for i in range(len(o)):
		z.append(o[i])
		z.append(e[i])

else:
	for i in range(len(e)):
		z.append(o[i])
		z.append(e[i])
	z.append(o[-1])

print(''.join(z))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a=input()
b=input()
ans=''
for x,y in zip(a,b):
  ans += (x+y)
print(ans if len(a) == len(b) else ans + a[-1])

Submission status: Accepted

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

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 = raw_input()
E = raw_input()
print "".join([O,E][i%2][i/2] for i in range(len(O)+len(E)))

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
o=input()
e=input()
s=""
while len(e)!=0:
    s+=o[0]
    o=o[1:]
    s+=e[0]
    e=e[1:]
if len(o)==1:
    s+=o[0]
print(s)

Submission status: Accepted

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

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))%2==1:
    print(O[-1])
    exit()
print()

Submission status: Accepted

Solution code:
o = input()
e = input()
ans = ''
for oo, ee in zip(o, e):
    ans = ans + oo + ee
if len(o) > len(e):
    ans = ans + o[-1]

print(ans)

Submission status: Accepted

Solution code:
a=input()
b=input()
for i in range(len(a)):
    print(a[i],end='')
    if i>len(b)-1:
        break
    else:
        print(b[i],end='')

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 = list(input())
e = list(input())
x = []
try:
    for i in range(0,len(o)):
        x.append(o[i])
        x.append(e[i])
except:
    print("".join(x))
else:
    print("".join(x))

Submission status: Accepted

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

print("".join(l))

Submission status: Accepted

Solution code:
o = str(input())
e = str(input())
l = []
for i in range(min(len(o),len(e))):
    l.append(o[i]+e[i])
    
if len(o) > len(e):
    l.append(o[-1])
elif len(o) < len(e):
    l.append(e[-1])

print("".join(l))

Submission status: Accepted

Solution code:
s=list(input())
t=list(input())
x=[]
for p in range(0,len(s+t),2):
  try:
    x.append(s[p//2])
    x.append(t[p//2])
  except:
    continue
print("".join(x))

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

Submission status: Accepted

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

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

if len(a)!=len(b):
  d+=a[-1]
  
print(d)

Submission status: Accepted

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

print(password)

Submission status: Accepted

Solution code:
o = input()
e = input()
ans = "".join([i+j for i,j in zip(o,e)])
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(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()
N = len(E)
ans = ''
for i in range(N):
    ans += O[i]
    ans += E[i]
        
if len(O) > N:
    ans += O[N]

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = str(input())
b = str(input())
s = ""
for i in range(min(len(a),len(b))):
    s += a[i]+b[i]
if len(a) > len(b):
    s += a[-1]
elif len(a) < len(b):
    s += b[-1]
print(s)

Submission status: Accepted

Solution code:
from itertools import zip_longest
print("".join([ o+e for o, e in zip_longest(input(), input(), fillvalue="")]))

Submission status: Accepted

Solution code:
def func():
    pass


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


def main2():
    o = input()
    e = input()
    ans = ""

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

if __name__ == '__main__':
    main2()

Submission status: Accepted

Solution code:
def func():
    pass


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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
ans  = ''
odd  = input()
even = input()
max_len = max(len(odd),len(even))

for i in range(max_len):
    if i < len(odd):
        ans += odd[i]
    if i < len(even):
        ans += even[i]

print(ans)

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

Submission status: Accepted

Solution code:
a = [input() for _ in range(2)]
ans = ""
for i in range(len(a[0])+len(a[1])):
    ans += a[0][i//2] if not i % 2 else a[1][i//2]
print(ans)

Submission status: Accepted

Solution code:
O = input()
E = input()
ans = ''
for o, e in zip(O, E):
    ans += o + e
    
if len(O) > len(E):
    ans += O[-1]
elif len(O) < len(E):
    ans += E[-1]
    
print(ans)

Submission status: Accepted

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

O = list(input())
E = list(input())

N = len(O) + len(E) - 2

pswd = ['' for _ in range(N)]
for i in range(N):
    pswd[i] = E.pop(0) if (i+1) % 2 == 0 else O.pop(0)
print(str(pswd).replace('[','').replace(']','').replace(',','').replace("'",'').replace(' ',''))

Submission status: Accepted

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

string1 = sys.stdin.readline().rstrip()
string2 = sys.stdin.readline().rstrip()

targ_str = ''
for i, j in zip(string1, string2):
    targ_str += i + j
if len(string1) > len(string2):
    targ_str += string1[-1]
print(targ_str)

Submission status: Accepted

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

ans = ""
for x, y in zip(s, t):
    ans += x + y
if len(s) > len(t):
    ans += s[-1]

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

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

print(pas)

Submission status: Accepted

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

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

Submission status: Accepted

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

for i, x in enumerate(o):
    print(x, end="")
    if len(e) > i:
        print(e[i], end="")

Submission status: Accepted

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

Submission status: Accepted

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

result = ""

while O + E:
    c1, O = O[:1], O[1:]
    c2, E = E[:1], E[1:]
    result += c1 + c2

print(result)

Submission status: Accepted

Solution code:
#  ABC 058
o = input()
e = input()
for i in range(min(len(o),len(e))):
    print('%s%s' % (o[i],e[i]), end='')
if len(o)>len(e): print(o[-1])

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from itertools import zip_longest

Os = input()
Es = input()

print(''.join([O + E for O, E in zip_longest(Os, Es, fillvalue='')]))

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:
from itertools import zip_longest
str_o = input()
str_e = input()

print("".join(["".join([o, e]) for o, e in zip_longest(str_o, str_e, fillvalue="")]))

Submission status: Accepted

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

while True:
    if len(o)>0:
        password += o[0:1]
        o = o[1:]
    else:
        print(password)
        break
    if len(e)>0:
        password += e[0:1]
        e = e[1:]
    else:
        print(password)
        break

Submission status: Accepted

Solution code:
while(True):
    try:
        o, e = [input() for _ in range(2)]
        s = ""
        for i in range(len(e)):
            s += o[i] + e[i]
        if len(o) != len(e):
            s += o[len(o) - 1]
        print(s)
    except EOFError:
        exit()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import itertools
str1 = input()
str2 = input()
print(''.join([c1 + c2 for c1, c2 in itertools.zip_longest(str1,str2,fillvalue="")]))

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=input();b=input()
for i in range(0,max(len(a),len(b))):
    if i<len(a):
        print(a[i],end='')
    if i<len(b):
        print(b[i],end='')

Submission status: Accepted

Solution code:
o=list(input())
e=list(input())
o.reverse()
e.reverse()
f1=False
f2=False
x=''
while True:
  if len(o)>0:
    x+=o.pop()
  else:
    f1=True
  if len(e)>0:
    x+=e.pop()
  else:
    f2=True
  if f1 and f2:
    break
print(x)

Submission status: Accepted

Solution code:
def abc058_b():
    o = input()
    e = input()
    passwd = [""] * (len(o) + len(e))
    for i in range(len(o)):
        passwd[2 * i] = o[i]
    for i in range(len(e)):
        passwd[2 * i + 1] = e[i]
    print("".join(passwd))


abc058_b()

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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[len(O)-1]
print(password)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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


def main():
    """Function."""
    o = str(input())
    e = str(input())

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

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

    print(txt)


if __name__ == "__main__":
    main()

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:
def main():
    o = list(input())
    e = list(input())
    if len(e) < len(o):
        e.append('')
    print(''.join(t[0] + t[1] for t in zip(o, e)))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a=input()
b=input()
s=""
while(len(a)>0):
  s+=a[0]
  a=a[1:]
  if(len(b)>0):
    s+=b[0]
    b=b[1:]
print(s)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
O = str(input())
E = str(input())
a = []
if len(O) == len(E):
  for i in range(len(O)):
    a.append(O[i]+E[i])
else:
  for i in range(len(O)-1):
    a.append(O[i]+E[i])
  a.append(O[-1])
L = "".join(a)
print(L)

Submission status: Accepted

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

Submission status: Accepted

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

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

print(s)

Submission status: Accepted

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

a = ''

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

Submission status: Accepted

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

for j in range(len(o)):
    print(o[j],end="")

Submission status: Accepted

Solution code:
from itertools import izip_longest
import sys
O = raw_input()
E = raw_input()

for o, e in izip_longest(O, E):
    sys.stdout.write(o or "")
    sys.stdout.write(e or "")
print

Submission status: Accepted

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

Submission status: Accepted

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

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]+E[i]
if len(O) > len(E):
    S += O[-1]
print(S)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import deque
o = deque(input())
e = deque(input())

output = []

while len(o) >0 and len(e) >0:
  output.append(o.popleft())
  output.append(e.popleft())

if len(o) !=0:
  output.append(o.popleft())
elif len(e) !=0:
  output.append(e.popleft())
else:
  pass

print("".join(output))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# https://beta.atcoder.jp/contests/abc058/tasks/abc058_b


def solve():
    print(''.join([(l+r) for l, r in zip(input(), input() + " ")]).strip())


if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
# https://beta.atcoder.jp/contests/abc058/tasks/abc058_b


def solve():
    # o >= e, o
    # e = 0 or 1
    o = input()
    e = input() + " "
    print(''.join([(l+r) for l, r in zip(o, e)]).strip())


if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
# https://beta.atcoder.jp/contests/abc058/tasks/abc058_b


def solve():
    o = input()
    e = input() + " "

    pw = ""
    for l, r in zip(o, e):
        pw += (l + r)

    print(pw.strip())


if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
# https://beta.atcoder.jp/contests/abc058/tasks/abc058_b


def solve():
    o = input()
    e = input()

    for l, r in zip(o, e):
        print('{}{}'.format(l, r), end="")

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


if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
# coding: utf-8
O = input()
E = input() + " "
print("".join([o+e for o,e in zip(O, E)]).strip())

Submission status: Accepted

Solution code:
# coding: utf-8
O = input()
E = input() + " "
print("".join([o+e for o,e in zip(O, E)]))

Submission status: Accepted

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

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

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:
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()
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:
odd = [i for i in input()]
even = [i for i in input()]
password_list = []
for i in range(len(even)):
    password_list.append(odd[i])
    password_list.append(even[i])
if len(odd) == len(even)+1:
    password_list.append(odd[len(odd)-1])
password = "".join(password_list)
print(password)

Submission status: Accepted

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

Submission status: Accepted

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

password = []
for i, cha in enumerate(o):
  password.insert(2*i,cha)
  
for i, cha in enumerate(e):
  password.insert(2 * i + 1, cha)

for cha in password:
  print(cha, end="")

Submission status: Accepted

Solution code:
s_odd = input()
s_even = input()
o = s_odd.__len__()
e = s_even.__len__()
s = [(s_odd[i] + s_even[i]) for i in range(e)]
if o - e == 1:
    s += s_odd[-1]
print(''.join(s))

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:
a = list(input())
b = list(input())
c = []
flag = False

if len(a) != len(b):
  flag = True
  b.append("X")

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

if flag == True:
  c.pop()
  print("".join(c))
else:
  print("".join(c))

Submission status: Accepted

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

length = len(O) + len(E)
s = ['0'] * length

for i in range(length):
    index = int(i / 2)
    if i % 2 == 0:
        s[i] = O[index]
    else:
        s[i] = E[index]


print(''.join(s))

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[-1]
elif len(O) < len(E):
    ans += E[-1]

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from itertools import zip_longest

O = input()
E = input()
ans = ()
for i in zip_longest(O,E,fillvalue=""):
   ans+=i
for i in ans:
    print(i ,end="")

Submission status: Accepted

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

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:
import itertools as t
s=input();d=input();print(''.join([i+j for i,j in t.zip_longest(s,d,fillvalue='')]))

Submission status: Accepted

Solution code:
s = [input() for _ in range(2)]
print(''.join(s[i%2][i//2] for i in range(len(s[0]) + len(s[1]))))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
##ABC 058
o = list(input())
e = list(input())

ans=[]

for i in range(min(len(o),len(e))):
    ans.append(o[0])
    o.pop(0)
    ans.append(e[0])
    e.pop(0)
               
print(''.join(ans)) if((o+e) == []) else print(''.join(ans+o+e))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
o=input()
e=input()

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

Submission status: Accepted

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

Submission status: Accepted

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

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

else:
    for i in range(len(O)):
        Z.append(O[i])
        Z.append(E[i])
    

print("".join(Z))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin


def main() -> int:
    o = next_str()
    e = next_str()

    ans = ""
    for i in range(max(len(o), len(e))):
        if i < len(o):
            ans += o[i]
        if i < len(e):
            ans += e[i]
    print(ans)
    return 0


def next_str() -> str:
    result = ""
    while True:
        tmp = stdin.read(1)
        if tmp.strip() != "":
            result += tmp
        elif tmp != '\r':
            break
    return result


if __name__ == '__main__':
    main()

Submission status: Accepted

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

while True:
    if len(Q) == 0 and len(E) == 0:
        break

    if len(Q) != 0:
        print(Q.pop(0),end="")


    if len(E) != 0:
        print(E.pop(0),end="")

Submission status: Accepted

Solution code:
o = list(input())
e = list(input())
x=[]
if len(e)==len(o):
	for i in range(len(e)):
		x.append(o[i])
		x.append(e[i])
if len(e)+1==len(o):
	for i in range(len(e)):
		x.append(o[i])
		x.append(e[i])
	x.append(o[len(o)-1])


print(''.join(x))

Submission status: Accepted

Solution code:
from itertools import zip_longest, chain

o = input()
e = input()

print("".join(chain(*zip_longest(o, e, fillvalue=""))))

Submission status: Accepted

Solution code:
n=input()
a=input()
c=str()
for i in range(0,len(a)):
    c+=n[i]+a[i]
print(c if len(n)==len(a) else c+n[len(n)-1])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(Pass)