Problem:


Score : 200 points

Problem Statement

Snuke signed up for a new website which holds programming competitions.
He worried that he might forget his password, and he took notes of it.
Since directly recording his password would cause him trouble if stolen,
he took two notes: one contains the characters at the odd-numbered positions, and the other contains the characters at the even-numbered positions.

You are given two strings O and E. O contains the characters at the odd-numbered positions retaining their relative order, and E contains the characters at the even-numbered positions retaining their relative order.
Restore the original password.

Constraints

O and E consists of lowercase English letters (a - z).

1 \leq |O|,|E| \leq 50

|O| - |E| is either 0 or 1.

Input

Input is given from Standard Input in the following format:

O
E

Output

Print the original password.

Sample Input 1

xyz
abc

Sample Output 1

xaybzc

The original password is xaybzc. Extracting the characters at the odd-numbered positions results in xyz, and extracting the characters at the even-numbered positions results in abc.

Sample Input 2

atcoderbeginnercontest
atcoderregularcontest

Sample Output 2

aattccooddeerrbreeggiunlnaerrccoonntteesstt



Sample input:
xyz
abc


Sample output:
xaybzc

Submission status: Accepted

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

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

Submission status: Accepted

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

    size = min(len(O), len(E))

    lis = []
    for i in range(size):
        lis.append(O[i] + E[i])

    if len(O) > size:
        lis.append(O[len(E):])
    elif len(E) > size:
        lis.append(E[len(O):])

    return "".join(lis)


if __name__ == '__main__':
    res = solve()
    print(res)

Submission status: Accepted

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

    size = min(len(O), len(E))

    res = ""
    for i in range(size):
        res += O[i] + E[i]

    if len(O) > size:
        res += O[len(E):]
    elif len(E) > size:
        res += E[len(O):]

    return res


if __name__ == '__main__':
    res = solve()
    print(res)

Submission status: Accepted

Solution code:
O = input()
E = input()
if len(O) == len(E):
    for s in zip(O, E):
        print(s[0] + s[1], end='')
    print()
else:
    print(O[0], end='')
    for s in zip(E, O[1:]):
        print(s[0] + s[1], end='')
    print()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from collections import deque
o = deque(list(input()))
e = deque(list(input()))
while e:
    print(o.popleft(), end='')
    print(e.popleft(), end='')

if o:
    print(o.popleft(), end='')
print('')

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
o = input()
e = input() + "0"
s = ""
for a, b in zip(o, e[:len(o)]):
    s = s + a + b
print(s.replace("0", ""))

Submission status: Accepted

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

O = list(input().rstrip('\n'))
E = list(input().rstrip('\n'))
n = len(O) + len(E)
A = []

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

Submission status: Accepted

Solution code:
import sys
import heapq, math
from itertools import zip_longest, permutations, combinations, combinations_with_replacement
from itertools import accumulate, dropwhile, takewhile, groupby
from functools import lru_cache
from copy import deepcopy

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

print("".join([o + (e if e else "") for (o, e) in zip_longest(O, E)]))

Submission status: Accepted

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

ans = ''
for a, b in zip(list(o), list(e)):
    ans += a+b

if len(o)-len(e) > 0:
    ans += o[-1]
print(ans)

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    o = list(input())
    e = list(input())
    s = []

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

if __name__ == '__main__':
    main()

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]
    continue
  s+=E[i//2]
print(s)

Submission status: Accepted

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

ans = ['' for _ in range(len(o)+len(e))]
for i in range(len(o)):
  ans[i*2] = o[i]
for i in range(len(e)):
  ans[i*2+1] = e[i]
print(''.join(ans))

Submission status: Accepted

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

Submission status: Accepted

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

for n in range(len(E)):
  ans.append(O[n])
  ans.append(E[n])

if len(O) != len(E):
  ans.append(O[-1])
  
print("".join(ans))

Submission status: Accepted

Solution code:
x = input()
y = input()
s = x + y
count = 0
ans = ""
for i in range(len(s)):
    if count%2 == 0:
        ans += s[count//2]
        count += 1
    else:
        ans += s[count//2+len(x)]
        count+=1
print(ans)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
from collections import deque, defaultdict
from math import sqrt, factorial
# def input(): return sys.stdin.readline()[:-1] # warning not \n
# def input(): return sys.stdin.buffer.readline().strip() # warning bytes
# def input(): return sys.stdin.buffer.readline().decode('utf-8')


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


t = 1
# t = int(input())
for case in range(1,t+1):
    ans = solve()




"""

4
1 2
2 4
1 3
3
2 2 4
4 5 6

6
1 2
2 3
3 4
4 5
4 6
3
3 5 6
2 17 31 5 11

"""

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(500000)

def input():
    return sys.stdin.readline()[:-1]

def mi():
    return map(int, input().split())

def ii():
    return int(input())

def i2(n):
    tmp = [list(mi()) for i in range(n)]
    return [list(i) for i in zip(*tmp)]


def main():
    O = input()
    E = input()
    ans = ''
    for i in range(len(O)+len(E)):
        if i%2:
            ans += E[i//2]
        else:
            ans += O[i//2]

    print(ans)



if __name__ == '__main__':
    main()

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()
Ol = len(O)
El = len(E)
alllen = Ol + El
num = 0
num_2 = 0
pw = ""
for i in range(alllen):
  if i % 2 == 0:
    pw+=O[num]
    num+=1
  else:
    pw+=E[num_2]
    num_2+=1
print(pw)

Submission status: Accepted

Solution code:
from itertools import zip_longest

O = input()
E = input()

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

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:
def i():
	return int(input())
def i2():
	return map(int,input().split())
def s():
	return str(input())
def l():
	return list(input())
def intl():
	return list(int(k) for k in input().split())

o = s()
e = s()

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

for (a, b) in zip(o, e):
    print(f'{a}{b}', end='')
if len(o) > len(e):
    print(o[-1], end='')
print()

Submission status: Accepted

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

N=len(O)
M=len(E)
ans=""
for i in range(N):
    ans+=O[i]
    if N-M==1 and i==M:
        break
    ans+=E[i]
print(ans)

Submission status: Accepted

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

a_len = len(a)
b_len = len(b)

huku = []

for i in range(a_len):
    if a_len != b_len and i==a_len-1:
        huku.append(a[i])
        break
    else:
        huku.append(a[i])
        huku.append(b[i])
for i in range(len(huku)):
    print(huku[i],end="")

Submission status: Accepted

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

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

ans = ''

if len(O) - len(E) == 1:
    E.append('')

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

print(ans)

Submission status: Accepted

Solution code:
# ABC058 B
O = list(input())
E = list(input())
pw = ""

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

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

print(pw)

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

Submission status: Accepted

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

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

Submission status: Accepted

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

if len(o) != len(e):
    e += [""]

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

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(E)):
    print(O[i]+E[i], end="")
  print(O[-1])

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

Submission status: Accepted

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

ans = []
n = 0
while n < len(o)+len(e):
  if n % 2 == 0:
    ans.append(o[n//2])
  else:
    ans.append(e[n//2])
  n += 1
print(*ans, sep='')

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

Submission status: Accepted

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


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

Submission status: Accepted

Solution code:
def main():
    O = input()
    E = input()
    last = ""
    if len(O) > len(E):
        last = O[-1]
        O = O[:-1]

    ans = ""
    for s1, s2 in zip(O, E):
        ans += s1 + s2

    ans += last
    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
print("".join(sum(zip(input(),input()+" "),())))

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
O,E=input(),list(input())+[""]
s = [i+j for i,j in zip(O,E)]
print(*s,sep="")

Submission status: Accepted

Solution code:
import sys
O = str(input())
E = str(input())
# print(O)
# print(E)
O_array = list(O)
E_array = list(E)
# print(O_array)
# print(E_array)
if not O.islower() or not E.islower():
    sys.exit()
if len(O) < 0 or len(O) > 50 or len(E) < 0 or len(E) > 50:
    sys.exit()
diff_length = len(O) - len(E)
if not (diff_length == 0 or diff_length == 1):
    sys.exit()

for e in range(len(E)):
    print(O[e], end='')
    print(E[e], end='')
if diff_length == 1:
    print(O[-1])
else:
    print('')

Submission status: Accepted

Solution code:
o=input()
e=input()
ans=[]
for i in range(max(len(o),len(e))):
  try:
    ans.append(o[i])
    ans.append(e[i])
  except:
    break
print("".join(ans))

Submission status: Accepted

Solution code:
o = list(str(input()))
x = list(str(input()))
ln = []
for i in range(len(o)):
    ln.append(o[i])
    if len(x) > i:
        ln.append(x[i])
print(''.join(ln))

Submission status: Accepted

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

ans = ''.join(''.join(s) for s in zip(O, E))
ans += O[-1] if len(O) - len(E) == 1 else ''
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if len(O) != len(E):
    for i in range(len(O)-1):
        pw += O[i]+E[i]
        if i == len(O)-2:
            pw += O[len(O)-1]
else:
    for j in range(len(O)):
        pw += O[j]+E[j]

print(pw)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python
# coding: utf-8

# In[3]:


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b=input(),input();
length = len(a)+len(b)
result = []
count1 = 0
count2 = 0
for i in range(length):
  if i % 2 == 0:
    try:
      result.append(a[count1])
      count1 += 1
    except:
      continue
  else:
    try:
      result.append(b[count2])
      count2 += 1
    except:
      continue
print(''.join(result))

Submission status: Accepted

Solution code:
O=input()
E=input()
ans=[]
for m in range(len(O)+len(E)):
    ans.append('k')
for i in range(len(O)):
    ans[2*i]=O[i]
for j in range(len(E))   :
    ans[2*j+1]=E[j]

ans=''.join(ans)
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

list = []

if len(O)==len(E):
    for i in range(len(O)):
        list.append(O[i])
        list.append(E[i])

else:
    for i in range(len(E)):
        list.append(O[i])
        list.append(E[i])
    list.append(O[-1])

L="".join(list)
print(L)

Submission status: Accepted

Solution code:
o = str(input())
e = str(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:
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()
x = len(E)
ans = ""
for i in range(len(O)-1):
    ans += O[i]
    ans += E[i]

ans += O[len(O)-1]
try:
    ans += E[len(O)-1]
except IndexError:
    pass
print(ans)

Submission status: Accepted

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

def main():
    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[-1])
    print(''.join(s))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
O=input()
E=input()
ans=[]
j=0
k=0
for i in range(len(O)+len(E)):
    if i%2==0:
        ans.append(O[k])
        k+=1
    else:
        ans.append(E[j])
        j+=1
print(*ans,sep="")

Submission status: Accepted

Solution code:
from itertools import zip_longest
o = input()
e = input()
for i, j in zip_longest(o,e,fillvalue=''):
  print(i+j, end='')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
O = input()
E = input()
psw = ""
for i in range(len(E)):
    psw = psw + O[i] + E[i]
if len(O) == len(E):
    print(psw)
else:
    print(psw+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:
#
from collections import Counter

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

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


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

Submission status: Accepted

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

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

Submission status: Accepted

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

K = len(E)

String = ""

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

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

print(String)

Submission status: Accepted

Solution code:
O=list(input())
E=list(input())+[""]
for x,y in zip(O, E):#zipにしてあげることで自動的にOが奇数、Eが偶数の場所になる
    print(x+y,end="")#あとは順次出力

Submission status: Accepted

Solution code:
print("".join([o+e for o, e in zip(input(), list(input())+[""])]))

Submission status: Accepted

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

for i in range(len(e)):
    k.append(o[i])
    k.append(e[i])

if len(o) > len(e):
    k.append(o[-1])

print(''.join(k))

Submission status: Accepted

Solution code:
import math
from collections import deque
from collections import defaultdict
import itertools as it

#自作関数群
def readInt():
	return int(input())
def readInts():
	return list(map(int, input().split()))
def readChar():
	return input()
def readChars():
	return input().split()
def factorization(n):
	res = []
	if n%2==0:
		res.append(2)
	for i in range(3,math.floor(n//2)+1,2):
		if n%i==0:
			c = 0
			for j in res:
				if i%j==0:
					c=1
			if c==0:
				res.append(i)
	return res
def fact2(n):
	p = factorization(n)
	res = []
	for i in p:
		c=0
		z=n
		while 1:
			if z%i==0:
				c+=1
				z/=i
			else:
				break
		res.append([i,c])
	return res
def fact(n):#階乗
	ans = 1
	m=n
	for _i in range(n-1):
		ans*=m
		m-=1
	return ans
def comb(n,r):#コンビネーション
	if n<r:
		return 0
	l = min(r,n-r)
	m=n
	u=1
	for _i in range(l):
		u*=m
		m-=1
	return u//fact(l)
def combmod(n,r,mod):
	return (fact(n)/fact(n-r)*pow(fact(r),mod-2,mod))%mod
def printQueue(q):
	r=copyQueue(q)
	ans=[0]*r.qsize()
	for i in range(r.qsize()-1,-1,-1):
		ans[i] = r.get()
	print(ans)
class UnionFind():
	def __init__(self, n):
		self.n = n
		self.parents = [-1]*n

	def find(self, x): # root
		if self.parents[x]<0:
			return x
		else:
			self.parents[x] = self.find(self.parents[x])
			return self.parents[x]

	def union(self,x,y):
		x = self.find(x)
		y = self.find(y)

		if x==y:
			return

		if self.parents[x]>self.parents[y]:
			x,y = y,x

		self.parents[x]+=self.parents[y]
		self.parents[y]=x

	def size(self,x):
		return -1*self.parents[self.find(x)]

	def same(self,x,y):
		return self.find(x)==self.find(y)

	def members(self,x): # much time
		root = self.find(x)
		return [i for i in range(self.n) if self.find(i)==root]

	def roots(self):
		return [i for i,x in enumerate(self.parents) if x<0]

	def group_count(self):
		return len(self.roots())

	def all_group_members(self):
		return {r: self.members(r) for r in self.roots()} # 1~n
def bitArr(n):#ビット全探索
	x = 1
	zero = "0"*n
	ans = []
	ans.append([0]*n)
	for i in range(2**n-1):
		ans.append(list(map(lambda x:int(x),list((zero+bin(x)[2:])[-1*n:]))))
		x+=1
	return ans;
def arrsSum(a1,a2):
	for i in range(len(a1)):
		a1[i]+=a2[i]
	return a1
def maxValue(a,b,v):
	v2 = v
	for i in range(v2,-1,-1):
		for j in range(v2//a+1): #j:aの個数
			k = i-a*j
			if k%b==0:
				return i
	return -1
def copyQueue(q):
	nq = queue.Queue()
	n = q.qsize()
	for i in range(n):
		x = q.get()
		q.put(x)
		nq.put(x)
	return nq
def get_sieve_of_eratosthenes(n):
	#data = [2]
	data = [0,0,0]
	for i in range(3,n+1,2):
		data.append(i)
		data.append(0)
	for i in range(len(data)):
		interval = data[i]
		if interval!=0:
			for j in range(i+interval,n-1,interval):
				data[j] = 0
	#ans = [x for x in data if x!=0]
	ans = data[:]
	return ans

o = readChar()
e = readChar()

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if len(s1)>len(s2):
    s2+=" "

s=[s1,s2]
sT=[list(x) for x in zip(*s)]

for i in range(len(s1)):
    print(sT[i][0],end="")
    print(sT[i][1],end="")

Submission status: Accepted

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

Submission status: Accepted

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

print(''.join(a + b for a, b in zip(O, E)))

Submission status: Accepted

Solution code:
from itertools import zip_longest

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=list(input())
t=list(input())
l=[]
for i in range(len(s)-1):
    l.append(s[i])
    l.append(t[i])
if len(s)>len(t):
    l.append(s[len(s)-1])
else:
    l.append(s[len(s)-1])
    l.append(t[len(t)-1])

x=''.join(l)
print(x)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
o=list(input())
e=list(input())
if len(o)!=len(e):
  e.append("")
ret=""
for (x,y)in zip(o,e):
  ret+=x+y

print(ret)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def joinstring(O, E) : 
  if len(O) - len(E) > 0 : 
    str = "".join([i + j for i, j in zip(O, E)])
    str += O[-1]
    return str
  else : 
    str = "".join([i + j for i, j in zip(O, E)])
  return str


O = input()
E = input()

print(joinstring(O, E))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#B問題
O = input()
E = input()
result = [""] * (len(O) + len(E))
for i in range(len(O)):
    result[2 * i] = O[i]
for i in range(len(E)):
    result[2 * i + 1] = E[i]
print("".join(result))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

print(s)

Submission status: Accepted

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

L = []
for i in range(len(O)):
  L.append(O[i])
  L.append("")

for j in range(len(E)):
  L[2*j+1] = E[j]

l = ""
for i in range(len(L)):
  l = l + L[i]

print(l)

Submission status: Accepted

Solution code:
import itertools as it
print("".join(it.chain.from_iterable(it.zip_longest(*[input() for _ in range(2)],fillvalue=""))))

Submission status: Accepted

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

res = ''
for i in range(len(O)):
    if i >= len(E):
        res += O[i]
    else:
        res += O[i] + E[i]

print(res)

Submission status: Accepted

Solution code:
O = input()
E = input()
l = min(len(O),len(E))
s = ""
for i in range(l):
  s = s+O[i]+E[i]
  
if s[2*(l-1)] == O[len(O)-1]:
  print(s)
else:
  print(s+O[len(O)-1])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math
def I():return int(sys.stdin.readline().replace("\n",""))
def I2():return map(int,sys.stdin.readline().replace("\n","").split())
def S():return str(sys.stdin.readline().replace("\n",""))
def L():return list(sys.stdin.readline().replace("\n",""))
def Intl():return [int(k) for k in sys.stdin.readline().replace("\n","").split()]
def Lx(k):return list(map(lambda x:int(x)*-k,sys.stdin.readline().replace("\n","").split()))

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

Submission status: Accepted

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

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:
o = input()
e = input()
s = ""
for a in range(max(len(o), len(e))):
    try:
        s += o[a]
    except IndexError:
        pass
    try:
        s += e[a]
    except IndexError:
        pass
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[len(O)-1]

print(ans)

Submission status: Accepted

Solution code:
O = str(input())
E = str(input())
E = E + " "
ans = ""
i = 0

while i<len(O):
  ans = ans + O[i] + E[i]
  i = i + 1

print(ans.rstrip(" "))

Submission status: Accepted

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

Submission status: Accepted

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

password = []
for i in range(len(O)):
    password += [O[i]]
    if i == len(O) - 1:
        if i != len(E):
            password += [E[i]]
    else:
        password += [E[i]]
print(''.join(password))

Submission status: Accepted

Solution code:
O = input()
#atcoderbeginnercontest

E = input()
#atcoderregularcontest
S = []

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

Submission status: Accepted

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

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

for i in range(len(o)):
  pw[2*i] = o[i]
for i in range(len(e)):
  pw[2*i+1] = e[i]
print("".join(pw))

Submission status: Accepted

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

Submission status: Accepted

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

ans = ''

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

print(ans)

Submission status: Accepted

Solution code:
o = input()
e = input()
flag = False
if len(o) == len(e):
    length = len(o)
else:
    flag = True
    length = len(e)

ans = ''

for a in range(length):
    ans += o[a]
    ans += e[a]

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

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

Submission status: Accepted

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

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