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 __future__ import print_function

import sys

import re
import array
import copy
import functools
import operator

import math
import string
import fractions
from fractions import Fraction
from fractions import gcd
# fractions.gcd() を用いること
# math.log2()はatcoderでは対応していない．留意せよ．

import collections
import itertools
import bisect

import random
import time

import heapq
from heapq import heappush
from heapq import heappop
from heapq import heappushpop
from heapq import heapify
from heapq import heapreplace
from queue import PriorityQueue as pq
from queue import Queue

from itertools import accumulate

from collections import deque
from collections import Counter

from operator import mul
from functools import reduce

input = sys.stdin.readline


def eprint(*args, **kwargs):
    print(*args, file=sys.stderr, **kwargs)
    return


def lcm(n, m):
    return int(n * m / gcd(n, m))


def coprimize(p, q):
    common = fractions.gcd(p, q)
    return (p // common, q // common)


def combinations_count(n, r):
    r = min(r, n - r)
    numer = reduce(mul, range(n, n - r, -1), 1)
    denom = reduce(mul, range(1, r + 1), 1)
    return numer // denom


def main():
    S = input().strip()
    L = input().strip()
    for i in range(max(len(S), len(L))):
        if i < len(S):
            print(S[i], end="")
        if i < len(L):
            print(L[i], end="")
    print()


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
O=input()
E=input()
N=min(len(O),len(E))
ans=''

for i in range(N):
    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(o)+len(e)):
  if i%2==0:
    ans+=o[i//2]
  else:
    ans+=e[i//2]
print(ans)

Submission status: Accepted

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

def main():
    o = input()
    e = input()
    res = ""
    for i in range(len(e)):
        res = res + o[i] + e[i]
    if len(o) > len(e):
        res = res + o[-1]
    print(res)

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
o=input()
e=input()
t=""
m=max(len(o),len(e))
for i in range(m):
    t+=o[i]
    if i==len(e):
        break
    t+=e[i]
print(t)

Submission status: Accepted

Solution code:
O=input("")
E=input("")
s=[]
lo=len(O)
le=len(E)
if(lo<le):
    p=lo
else:
    p=le
for i in range(p):
    s.append(O[i])
    s.append(E[i])

if(lo==le):
    print(''.join(s))
elif(lo<le):
    s.append(E[le-1])
    print(''.join(s))
else:
    s.append(O[lo-1])
    print(''.join(s))

Submission status: Accepted

Solution code:
o = input()
e = input()
n = len(o)
m = len(e)
st = [0]*(n+m)
for i in range(0,n):
  try:
    st[i*2]=o[i]
  except:
    pass
  try:
    st[i*2+1]=e[i]
  except:
    pass
string = "".join(map(str,st)) 
print(string)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
O = input()
E = input()
P = ""
i=0
for i in range(min(len(O),len(E))):
    P+=O[i]
    P+=E[i]
if len(O)>len(E):
  P+=O[len(O)-1]
elif len(O)<len(E):
  P+=E[len(E)-1]
print(P)

Submission status: Accepted

Solution code:
o=input("")
e=input("")
s=[]
l1=len(o)
l2=len(e)
if(l1<l2):
    p=l1
else:
    p=l2
for i in range(p):
    s.append(o[i])
    s.append(e[i])

if(l1==l2):
    print(''.join(s))
elif(l1<l2):
    s.append(e[l2-1])
    print(''.join(s))
else:
    s.append(o[l1-1])
    print(''.join(s))

Submission status: Accepted

Solution code:
o=raw_input("")
e=raw_input("")
final=""
i=j=0
while(i<len(o) or j<len(e)):
    if(i<len(o)):
        final+=o[i]
        i+=1
    if(j<len(e)):
        final+=e[j]
        j+=1
print(final)

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="")

Submission status: Accepted

Solution code:
o=input()
e=input()
ans=''
lo = len(o)
le = len(e)

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

if lo<le:
    ans+=e[lo:]
elif le<lo:
    ans+=o[le:]

print(ans)

Submission status: Accepted

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

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


if __name__ == "__main__":
    solve()

Submission status: Accepted

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

o=list(O)
e=list(E)

str=[0 for i in range(len(o)+len(e))]
j=0
for i in range(0,len(o)):
    str[j]=o[i]
    j+=2
j=1
for i in range(0,len(e)):
    str[j]=e[i]
    j+=2
s=""
for i in range(len(str)):
    s=s+str[i]
print(s)

Submission status: Accepted

Solution code:
o = input()
e = list(input())
a = ""
for s in o:
  a += s
  if e != []: 
    a += e.pop(0)
print(a)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
o = input()
e = input()
a=[]
if len(o) == len(e):
  for i in range(len(e)):
  	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))

Submission status: Accepted

Solution code:
o = input()
e = input()
l = []
for  i in range(max(len(o),len(e))):
        
        
    l.append(o[i])
    if len(o) - len(e) == 1 and i == len(o) - 1:
        break
        
    l.append(e[i])
print("".join(l))

Submission status: Accepted

Solution code:
O = list(input())
E = list(input())
L = len(O)+len(E)
a = list()
for i in range(L):
    if i < len(E):
        a.append(O[i])
        a.append(E[i])
        i += 1
if len(O) != len(E):
    a.append(O[-1])
b = "".join(a)
print(b)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
# input = sys.stdin.readline
def INT(): return int(input())
def MAP(): return map(int,input().split())
def LI(): return list(map(int,input().split()))

def main():
    O = input()
    E = input()
    answer = ""
    for i in range(len(O+E)):
        if i%2 == 0:
            answer += O[i//2]
        else:
            answer += E[(i-1)//2]
    print(answer)

    return

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# import bisect
# import copy
# import fractions
# import math
# import numpy as np
# from collections import Counter, deque
# from itertools import accumulate,permutations, combinations,combinations_with_replacement,product

def resolve():
    O=list(input())
    E=list(input())
    p=[]
    for i in range(len(O)):
        p.insert(i*2,O[i])
    for j in range(len(E)):
        p.insert(1+j * 2, E[j])

    print(''.join(p))

resolve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:


def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))

def main():
    mod=10**9+7
    O=input()
    E=input()
    ans=["a"]*100
    NO=len(O)
    NE=len(E)
    for i in range(NO):
        ans[i*2]=O[i]
    for i in range(NE):
        ans[i*2+1]=E[i]
        
    print(''.join(map(str, ans[:NO+NE])))

main()

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())
m=list(input())
"""
ans=[]
for i in range(len(o)-1):
            ans.append(o[i])
            ans.append(m[i])
ans.append(o[-1])
if len(o)==len(m):
            ans.append(m[-1])
print("".join(ans))
"""
ans=' '
for i in range(len(o)-1):
            ans +=o[i]
            ans +=m[i]
ans +=o[-1]
if len(o)==len(m):
            ans+=m[-1]
print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

    ans = []

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

    ans.append(O[-1])

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

    print("".join(ans))


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

O = input()
E = input()

len_E = len(E)
len_O = len(O)

E_count = 0
O_count = 0

total_len = len_E + len_O

ans = ''

for t in range(1, total_len + 1):
    if t % 2 == 0:
        ans = ans + E[E_count]
        E_count += 1
    else:
        ans = ans + O[O_count]
        O_count += 1

print(ans)

Submission status: Accepted

Solution code:
oo=input().strip()
ee=input().strip()

ol=[]
el=[]
for o in oo:
  ol.append(o)

for e in ee:
  el.append(e)

if len(ol)!=len(el):
  el.append("")

ans=""
for i in range(len(ol)):
  ans+=ol[i]
  ans+=el[i]
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) == 1:
    ans += O[len(O)-1]
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='')
print()

Submission status: Accepted

Solution code:
O=input()
E=input()
a=[b for b in O]
c=[d for d in E]
answer=[]
count=0
while not count==len(c):
    answer.append(O[count])
    answer.append(E[count])
    count+=1
if len(a)-len(c)==1:
    answer.append(O[len(a)-1])
moji=''
for z in answer:
    moji+=z
print(moji)

Submission status: Accepted

Solution code:
o = input()
e = input()
i = 0
l = []
while i < len(o):
  l.append(o[i])
  if i == len(e):
    break
  else:
    l.append(e[i])
  i += 1
print(*l,sep="")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input()
b = input()
s = ""
for i in range(len(b)):
  s = s + a[i]
  s = s + b[i]
if len(a) != len(b):
  s = s + a[len(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:
#!/usr/bin/env python3
import sys


def solve(O: str, E: str):
    print("".join(oi + ei for oi, ei in zip(O, E + " ")).strip())


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
o = list(input())
e = list(input())

len_o = len(o)
len_e = len(e)

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], end = '')
    print(e[len_e - 1])

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

Submission status: Accepted

Solution code:
a = input()
b = input()
c = ""
for i in range(ｌｅｎ(a)):
  if i == len(b):
  	c += a[i]
  else:
    c += a[i] + b[i]
print(c)

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(E)==len(O):
    print("".join(ans))
else:
    ans.append(O[-1])
    print("".join(ans))

Submission status: Accepted

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

num = len(O) + len(E)
password =''
for i in range(1, num+1):
  if i % 2 ==0:
    n = i // 2
    password += E[n-1]
  else:
    n = i // 2 + 1
    password += O[n-1]
print(password)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
o=input()+" "
e=input()+" "
ans=""
for i,j in zip(o,e):
  ans+=i
  ans+=j
  
print(ans)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

for i in range(len(O)):
  o.append(O[i])
  
for j in range(len(E)):
  e.append(E[j])
  
if len(o) == len(e):
  for k in range(len(o)):
    ans.append(o[k])
    ans.append(e[k])
    
  print("".join(ans))
  exit()
  
if len(o) != len(e):
  for l in range(len(e)):
    ans.append(o[l])
    ans.append(e[l])
    
  ans.append(o[-1])
  print("".join(ans))
  exit()

Submission status: Accepted

Solution code:
from collections import deque
o = deque(list(input()))
e = deque(list(input()))
pas = []
while (o or e):
    if o:
        pas.append(o.popleft())
    if e:
        pas.append(e.popleft())
    
print(*pas, sep="")

Submission status: Accepted

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

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

if len(a) > len(b):
    c.append(a[-1])

print(''.join(c))

Submission status: Accepted

Solution code:
import sys
import os


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

    ODD = list(map(str, sys.stdin.readline().rstrip()))
    EVEN = list(map(str, sys.stdin.readline().rstrip()))+[""]

    for o, e in zip(ODD, EVEN):
        print(o+e, end="")


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#ABC058
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:
a = input()
b = input()
f = abs(len(a) - len(b))
if f== 0 :
  pass
else :
  if len(a)<len(b):
    a+=" "
  else :
    b += " "
s = ""
for i,j in zip(a,b):
  s+= i+j
print(s.replace(' ', ''))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#058_B
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 = [None] * (len(O)+len(E))
ans[::2],ans[1::2] = O,E
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):
  ans+=o[-1]
print(ans)

Submission status: Accepted

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

ans=[]
for i in range(len(o)+len(e)):
        if i%2==0:
                ans.append(o[i//2])
        else:
                ans.append(e[i//2])
print(*ans,sep="")

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()
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:
odd=list(input())
even=list(input())
ans=[]
for i in range(1,len(odd)+len(even)+1):
    if i%2!=0:
        ans.append(odd[i//2])
    else:
        ans.append(even[i//2-1])
for i in range(len(ans)):
    print(ans[i],end="")

Submission status: Accepted

Solution code:
import sys
import bisect
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
o = readline().rstrip().decode('utf-8')
e = readline().rstrip().decode('utf-8')
ans = []
for i in range(len(e)):
    ans.append(o[i])
    ans.append(e[i])
if len(o) == len(e)+1:
    ans.append(o[-1])

print("".join(ans))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    odd_str = input()
    even_str = input()
    answer = [""] * (len(odd_str) + len(even_str))
    for i in range(len(odd_str)):
        answer[2 * i] = odd_str[i]
    for i in range(len(even_str)):
        answer[2 * i + 1] = even_str[i]
    print("".join(answer))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
o=input()
e=input()
n=len(o)+len(e)
ans=''
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:
from itertools import zip_longest

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = input()
y = input()

i = 0

while i < len(x):
  print(x[i], end="")
  if i >= len(y):
    break
  print(y[i], end="")
  i += 1

Submission status: Accepted

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

#----------
O = input().strip()
E = input().strip()
#----------

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

print(new_S)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
A=list(input())
B=list(input())
L=["0"]*(len(A)+len(B))
L[::2]=A
L[1::2]=B
print("".join(L))

Submission status: Accepted

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

Submission status: Accepted

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

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

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:
a = list(input())
b = list(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
O = input()
E = input()
len_O = len(O)
len_E = len(E)
if len_O == len_E :
    for i in range(len_O) :
        print(O[i] + E[i], end="")
elif len_O > len_E :
    for i in range(len_O - 1) :
        print(O[i] + E[i], end="")
    print(O[len_O - 1])

Submission status: Accepted

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


def solve(O: str, E: str):
    password = ''
    for i in range(len(O)):
        password += O[i]
        if len(E) > i:
            password+= E[i]
    print(password)
    return


# Generated by 1.1.6 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:


if __name__ == '__main__':
    O=input()
    E=input()
    O=list(O)
    E=list(E)
    password=[]
    n=min(O.__len__(),E.__len__())
    for i in range(n):
        password.append(O.pop(0))
        password.append(E.pop(0))
    password+=O
    password+=E
    print("".join(password))

Submission status: Accepted

Solution code:
o = input()
e = input()
print(''.join([a+b for a,b in zip(o,e)]) + o[len(e):])

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
O,E = [input() for _ in range(2)]
S = []
for i in range(len(O)):
    S.append(O[i])
    if i<=len(E)-1:S.append(E[i])
print(*S,sep='')

Submission status: Accepted

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

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 i,j in zip(o,e): print(i+j,end="")

Submission status: Accepted

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

for i in range(len(O) + 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()
print()
ans = ""

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

Submission status: Accepted

Solution code:
o=input()
e=input()
ans=['']*(len(o)+len(e))
flg=1
for i in range(len(o)):
	ans[i*2]=o[i]
for j in range(len(e)):
	ans[j*2+1]=e[j]
for k in range(len(ans)):
	print(ans[k],end="")

Submission status: Accepted

Solution code:
s=input()+' '
t=input()+' '
st=''

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

Submission status: Accepted

Solution code:
s=input()+' '
t=input()+' '
st=''

for i in range(min(len(s),len(t))):
    st+=s[i]
    st+=t[i]
print(st.strip())

Submission status: Accepted

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

print(''.join(lis))

Submission status: Accepted

Solution code:
o = input()
e = input()
s = ['_']*(len(o)+len(e))
for i,c in enumerate(o):
  s[2*i] = c
for i,c in enumerate(e):
  s[2*i+1] = c
print(''.join(s))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=input()
b=input()
n=0
c=1
S=""
if len(a)==len(b):
    for _ in range(len(a)):
        S=(S+(a[n]+b[n]))
        n+=1
    print(S)
else:
    for _ in range(len(b)):
        S=(S+(a[n]+b[n]))
        n+=1
    print(S+a[n])

Submission status: Accepted

Solution code:
ol = list(input())
el = list(input())
ans = ''

for i in range(min(len(ol), len(el))):
    ans += ol.pop(0) + el.pop(0)
if len(ol) > 0:
    ans += ol.pop()

print(ans)

Submission status: Accepted

Solution code:
O=input()
E=input()
n=min(len(E),len(O))
ans=""
for i in range(n):
    ans = ans + O[i]
    ans = ans + E[i]

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

Submission status: Accepted

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

for i in range(len(E)):
    pswd="".join((pswd,O[i],E[i]))

if len(O)>len(E):
    pswd="".join((pswd,O[len(O)-1]))

print(pswd)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
O = list(input())
E = list(input())
N = len(O)+len(E)
if len(O)>len(E):
    E += ' '
elif len(O)<len(E):
    O += ' '
answer = []
for i,j in zip(O,E):
    answer.append(i)
    answer.append(j)
print(''.join(answer))

Submission status: Accepted

Solution code:

A = input()
E = input()

ans = ''
for a, e in zip(A, E):
    ans += a + e
if len(A) > len(E):
    ans += A[-1]
print(ans)

Submission status: Accepted

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

ans=[]

for oo,ee in zip(o,e):
    ans.append(oo+ee)

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

print("".join(ans))

Submission status: Accepted

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

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

count=0
for oo in o:
    ans[count] = oo
    count+=2
    
count=1
for ee in e:
    ans[count] = ee
    count+=2

print("".join(ans))

Submission status: Accepted

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


def main():
    O = list(input())
    E = list(input())
    for o, e in zip(O, E):
        print(o, e, end='', sep='')
    if len(O) > len(E):
        print(O[-1])


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def pw(o , e):
    ans = ""
    olist = list(o)
    elist = list(e)

    for i in range(len(e)):
        ans += olist[i]
        ans += elist[i]

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

    return ans


def main():
    o = str(input())
    e = str(input())
    print(pw(o , e))

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
O=input()
E=input()
letter=""
for o in O:
    letter+=o+"!"

for e in E:
    letter=letter.replace("!",e,1)
letter=letter.rstrip("!")
print(letter)

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, log2
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
from bisect import bisect

def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

O = input()
E = input()

ans = ""
for x, y in zip(O, E):
	ans += x+y
if (len(O)-len(E))%2==1:
	ans += O[-1]
print(ans)