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: Runtime Error

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

Submission status: Runtime Error

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

s = ''.join(l)

print(s)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import collections
import sys
import numpy as np
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
MOD = 10**9+7
import itertools
import math

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

Submission status: Runtime Error

Solution code:
import collections
import sys
import numpy as np
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
MOD = 10**9+7
import itertools
import math

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

if len(o) > len(e):
    e.append('')
ans = ''

while len(o):
    ans += o.popleft()
    ans += e.popleft()
print(ans)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
O = input()
E = input()
a = str()
for i in range(len(O)):
    a += O[i] + E[i]
print(a)

Submission status: Runtime Error

Solution code:
import java.util.*;

public class Main {

    public static void main(String args[]) {

        // 入力
        Scanner sc = new Scanner(System.in);
        String o = sc.next();
        String e = sc.next();
        sc.close();

        // 主処理
        char[] co = o.toCharArray();
        char[] ce = e.toCharArray();
        String result = "";
        for (int i = 0; i < co.length; i++) {
            result += co[i];
            if (i < ce.length) {
                result += ce[i];
            }
        }

        // 出力
        System.out.println(result);
    }
}

Submission status: Runtime Error

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

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

print(ans)

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using ld = long double;
using vi = vector<int>;
using vll = vector<ll>;
using P = pair<int, int>;

const int INF = 1e9;
const ll INFLL = 1e18;
const int MOD = 1e9 + 7;
const int NIL = -1;
const ld PI = acosl(-1);

#define rep(i,n) for(int i=0; i<(n); ++i)
#define all(n) n.begin(),n.end()

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

int main() {
	ios::sync_with_stdio(false); cin.tie(nullptr);
	//cout << fixed << setprecision(6);
	string o, e;
	cin >> o >> e;

	rep(i, max(o.length(), e.length())){
		cout << o[i] << e[i];
	}
	cout << endl;
	return 0;
}

Submission status: Runtime Error

Solution code:
O=input()
E=input()
R=[:len(E)]
print(*[e+r for e,r in zip(E,R)],sep="",end="")
if len(O)!=len(E):
  print(O[-1])

Submission status: Runtime Error

Solution code:
O = list(input())
E = list(input())
ans = list()
 
for i in range(len(O)):
    ans.append(O[i])
    if i > len(E):
        break
    else:
        ans.append(E[i])
result = "".join(ans)
print(result)

Submission status: Runtime Error

Solution code:
O = list(input())
E = list(input())
ans = list()
 
for i in range(len(O)):
    ans.append(O[i])
    if not E[i]:
        break
    else:
        ans.append(E[i])
result = "".join(ans)
print(result)

Submission status: Runtime Error

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

for i in range(len(O)):
    ans.append(O[i])
    ans.append(E[i])
result = "".join(ans)
print(result)

Submission status: Runtime Error

Solution code:
a=input()
b=input()
cnt=0
passw=''
if (len(a)-len(b))==1:
  while 1:
      passw=passw+a[cnt]+b[cnt]
      cnt=cnt+1
      if (cnt+1)>len(b):
        passw=passw+a[cnt+1]
        break
else:
  while 1:
      passw=passw+a[cnt]+b[cnt]
      cnt=cnt+1
      if (cnt+1)>len(b):
        break
print(passw)

Submission status: Runtime Error

Solution code:
O, E = map(str, input().split())
a = ''
for i in O:
    a += i
    for j in E:
        a += j
        E = E.lstrip(j)
        break
print(a)

Submission status: Runtime Error

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

ans = ""
for i,j in s1,s2:
  ans += i+j
print(ans)

Submission status: Runtime Error

Solution code:
O=list(input())
E=list(input())
F=[]
j=0
k=0
for i in range(0,len(O)+len(E)):
    F.append('0')
while j<(len(O)+len(E)):
    if j%2==0:
        F[j]=E[j//2]
    else:
        F[j] = O[j//2]
    j=j+1
F= ''.join([str(elem) for elem in F])
print(F)

Submission status: Runtime Error

Solution code:
O=[]
E=[]
P=[]
Olength=int(input("Enter the length of odd Characters")
for i in range (o,Olength):
 x=input("ENTER cHARACTERS")
 O.append(x)
Elength=int(input("Enter the length of even Characters")
for i in range (o,Elength):
 x=input("ENTER cHARACTERS")
 E.append(x)
for i in range (o,Olength):
 P.append(O[i])
 P.append(E[i])

for i in range (o, P.length):
 print(P[i])

Submission status: Runtime Error

Solution code:
O=list(input())
E=list(input())
F=[]
j=0
k=0
F=[0]*(len(O)+len(E))

while j<(len(O)+len(E)):
    F[j]=E[k]
    j=j+2
    k=k+1
j=1 
k=0
while j<(len(O)+len(E)):
    F[j]=O[k]
    j=j+2
    k=k+1 
F= ''.join([str(elem) for elem in F])
print(F)

Submission status: Runtime Error

Solution code:
O=list(input())
E=list(input())
F=[]
j=0
k=0
for i in range(0,len(O)+len(E)):
    F.append('0')
while j<(len(O)+len(E)):
    F[j]=E[k]
    j=j+2
    k=k+1
j=1 
k=0
while j<(len(O)+len(E)):
    F[j]=O[k]
    j=j+2
    k=k+1 
F= ''.join([str(elem) for elem in F])
print(F)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
o=list(input())
m=list(input())
ans=' '
for i in range(len(o)):
            
                        ans +=o[i]
                        ans +=m[i]
                        
print(ans)

Submission status: Runtime Error

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: Runtime Error

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

Submission status: Runtime Error

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

print("".join(ans))

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
s=input()
t=input()
st=''
for i in range(len(s)):
    st+=s[i]
    st+=t[i]
print(st)

Submission status: Runtime Error

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])
elif len(o)==len(e):
    lis.append(o[-1])
    lis.append(e[-1])

print(''.join(lis))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
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
 
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
 
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

a = input()
b = input()
l = []
for i in range(len(a)):
    l.append(a[i])
    l.append(b[i])
print("".join(l))

Submission status: Runtime Error

Solution code:
A=str(input())
B=str(input())
a=list(A)
b=list(B)
t=''
for i in range(len(a)):
  t+=a[i]+b[i]
if len(a)>len(b):
  t+=a[len(a)-1]
print(t)

Submission status: Runtime Error

Solution code:
A=str(input())
B=str(input())
a=list(A)
b=list(B)
t=''
for i in range(len(a)+len(b)):
  t+=a[i]+b[i]
if len(a)>len(b):
  t+=a[len(a)-1]
print(t)

Submission status: Runtime Error

Solution code:
even = input()
odd = input()
if (even - odd) % 2 == 0:
    for i in range(len(even)):
        print(even[i], odd[i], sep="", end="")
else:
    for i in range(len(even)-1):
        print(even[i], odd[i], sep="", end="")
    print(even[-1])

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
O = list(input().split(" "))
E = list(input().split(" "))

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

print("".join(ans))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a=lst(input())
b=input()
i=0
for j in b:
	a[i:i]=j
    i+=1
print(*a)

Submission status: Runtime Error

Solution code:
x=list(input())
y=list(input())+''
for a, b in zip(x, y):
  print(a+b, end='')

Submission status: Runtime Error

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

Submission status: Runtime Error

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

n = len(o)
for i in range(n):
  print(o[i] + e[i], end='')

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:

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

count = 0

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

print("".join(ans))

Submission status: Runtime Error

Solution code:
from itertools import zip_longest

odds, evens = [input() for _ in range(2)]
if len(odds) > len(evens):
    evens.append("")
chars = []
for odd, even in zip_longest(odd, even, fillvalue=""):
    chars.append(odd)
    chars.append(even)
ans = "".join(chars)
print(ans)

Submission status: Runtime Error

Solution code:
odds, evens = input().split()
chars = []
for odd, even in zip(odds, evens):
    chars.append(odd)
    chars.append(even)
ans = "".join(chars)
print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

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


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

Submission status: Runtime Error

Solution code:
o = list(input())
e = list(input())
if len(o) > len(e):
  e.append("")

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

Submission status: Runtime Error

Solution code:
o = list(input())
e = list(input())
if len(o) > len(e):
  e.add("")
for i in range(o):
  print(o[i] + e[i], end='')

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
O, E = [input() for _ in range(2)]
E += " "

length = max(len(O), len(E))

for i in range(length):
    print(O[i], end='')
    print(E[i], end='')

Submission status: Runtime Error

Solution code:
O, E = [input() for _ in range(2)]
E += ""

length = max(len(O), len(E))

for i in range(length):
    print(O[i], end='')
    print(E[i], end='')

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
a= input()
b = input()
for i in range(len(a)*2):
    if i%2:
        print(a[i//2],end='')
    else:
        print(b[i//2],end='')
print()

Submission status: Runtime Error

Solution code:
a= input()
b = input()
for i in range(len(a)*2):
    if i%2:
        print(a[i/2],end='')
    else:
        print(b[i/2],end='')
print()

Submission status: Runtime Error

Solution code:
o = input()
n1 = len(o)
e = input()
n2 = len(e)
for i in range(max(n1,n2)):
  print(o[i] + e[i], end = "")

Submission status: Runtime Error

Solution code:
O = input()
E = input()
Answer = ''
for i in range(len(O)):
  Answer = Answer + O[i]
  Answer = Answer + E[i]
print(Answer)

Submission status: Runtime Error

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

j = 0
k = 0

for i in range(len(O)*2):
  if i % 2 ==0:
    print(E[j],end="")
    j = j + 1
  else:
    print(O[k],end="")
    k = k + 1

Submission status: Runtime Error

Solution code:
#∵∴∵
O = input()
E = input()
S = ""
for i in range(len(E)):
    S = S + O[i]
    S = S + E[i]
if len(E) < len(O):
    S = S + S[len(O)]
print(S)

Submission status: Runtime Error

Solution code:
o=input()
p=input()
print(''.join(i+j for i,j in zip (o,p))

Submission status: Runtime Error

Solution code:
o=input()
p=input()
print(''.join(i+j in zip (o,p))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

L=[0]*(len(a)*2)
for i in range(len(a)-1):
  L[i*2]=a[i]
  L[i*2+1]=b[i]
L[len(a)*2]=a[-1]

if len(a)>len(b):
  del L[len(a)*2+1]
else:
  L[-1]=b[-1]

print("".join(L))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a=input()
b=input()
n=[]
for i in range(len(a)):
  n.append(a[i])
  n.append(b[i])
print("".join(n))

Submission status: Runtime Error

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

i = 0
res = []
while True:
    if o[i]:
        res.append(o[i])
    else:
        break
    if e[i]:
        res.append(e[i])
        i += 1
    else:
        break

print(''.join(res))

Submission status: Runtime Error

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

i = 0
res = []
while True:
    if o[i]:
        res.append(o[i])
    else:
        break
    if e[i]:
        res.append(e[i])
        i += 1
    else:
        break

print(''.join(res))

Submission status: Runtime Error

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

i = 0
res = []
while True:
    res.append(o[i])
    if e[i]:
        res.append(e[i])
        i += 1
    else:
        break

print(''.join(res))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

for i in range(E.length()):
  print(O[i], end='')
  print(E[i], end='')
  
if not(E.length() == O.length()):
  print(O[O.length() - 1])

Submission status: Runtime Error

Solution code:
O = input()
E = input()
dif_len = len(O) - len(E)
password = ''

if dif_len == 0:
    for i in range(max_len):
        password += O[i] + E[i]
elif dif_len > 0:
    for i in range(len(O)):
        if i != len(O) - 1:
            password += O[i] + E[i]
        else:
            password += O[i]

print(password)

Submission status: Runtime Error

Solution code:
O = input()
E = input()
dif_len = len(O) - len(E)
password = ''

if dif_len == 0:
    for i in range(max_len):
        password += O[i] + E[i]
elif dif_len > 0:
    for i in range(len(O)):
        if i != len(O) - 1:
            password += O[i] + E[i]
        else:
            password += O[i]
else:
    for i in range(len(E)):
        if i != len(E) - 1:
            password += O[i] + E[i]
        else:
            password += E[i]

print(password)

Submission status: Runtime Error

Solution code:
O = input()
E = input()
dif_len = len(O) - len(E)
password = ''

if dif_len == 0:
    for i in range(max_len):
        password += O[i] + E[i]
elif dif_len > 0:
    for i in range(len(O)):
        if i != len(O) - 1:
            password += O[i] + E[i]
        else:
            password += O[i]
elif dif_len < 0:
    for i in range(len(E)):
        if i != len(E) - 1:
            password += O[i] + E[i]
        else:
            password += E[i]

print(password)

Submission status: Runtime Error

Solution code:
O = input()
E = input()
str = ""
i = 0
while True:
  str = str + O[i]
  if len(E)-1<i:
    exit(1)
  str = str + E[i]
  i+=1
  
print(str)

Submission status: Runtime Error

Solution code:
O = input()
E = input()
str = ""
i = 0
while True:
  str = str + O[i]
  if len(E)-1<i:
    break
  str = str + E[i]
  i+=1
  
print(str)

Submission status: Runtime Error

Solution code:
O = input().strip()
E = input().strip()
x = ""
for i in range(2*len(E)):
    if i%2==0:
        x += O[i]
    else:
        x += E[i]
if len(O)>len(E):
    x += O[-1]
print(x)

Submission status: Runtime Error

Solution code:
O = input()
E = input()
answer = ""
i = 1
o = 0
e = 0
while i < len(E):
  if i % 2 != 0:
    answer.append(O[o])
    o += 1
  else:
    answer.append(E[e])
    e += 1
  i += 1

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

return answer

Submission status: Runtime Error

Solution code:
s1=input()
s2=input()
n=len(s1)
ans=''
for i in range(n):
    ans+=s1[i]+s2[i]
print(ans)

Submission status: Runtime Error

Solution code:
o=list(input())
e=list(input())+[""]
n=max(len(o),len(e))
for i in range(n):
  print(o[i],end="")
  print(e[i],end="")

Submission status: Runtime Error

Solution code:
o=list(input())
e=list(input())+[""]
n=max(len(o),len(e))
for i in range(n):
  print(o[i]+e[i],end="")

Submission status: Runtime Error

Solution code:
o=list(input())
e=list(input())
n=max(len(o),len(e))
for i in range(n):
  print(o[i]+e[i],end="")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
O,E=map(int,input().split())
for i in range(O.size()):
  print(O[i]+E[i],end='')

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
o=list(input())
e=list(input())
p=list(o + e)
for i in range(len(p)):
	if i % 2 == 1 :
		p[i-1]=o[int((i-1)/2)]
	else:
		p[i-1]=o[int((i/2)-1)]
print("".join(pass))

Submission status: Runtime Error

Solution code:
o=list(input())
e=list(input())
p=list(o + e)
for i in range(len(p)):
	if i % 2 = 1 :
		p[i-1]=o[int((i-1)/2)]
	else:
		p[i-1]=o[int((i/2)-1)]
print("".join(pass))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

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

Submission status: Runtime Error

Solution code:
from itertools import zip_longest
print("".join(sum(zip_longest(input(), input()), tuple())))

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

ans = ""

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

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

print(ans)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
o, e = [input().rstrip() for i in range(2)]
lst = []
for i in len(o):
    print(o[i], end='')

    if i + 1 > len(e):
        print()
        break
    else:
        print(e[i], end='')

Submission status: Runtime Error

Solution code:
a=input()
b=input()
m=""
for i in range(len(a)):
    m=m+a[i]+b[i]
    i +=1
print(m)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
odds = input()
evens = input()

password = "".join(a + b for (a, b) in zip(odds, evens)
if len(odds) > len(evens):
	password += odds[-1]
                   
print(password)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

pas = [O[i] + E[i] for i in range(len(O))]
print(''.join(pas))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

o_length = len(o)
e_length = len(e)

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
o = input()
e = input()
x = []
if len(o) == len(e):
  for i in range(len(o)):
    x.append(o[i]+e[i])
else:
  for i in range(len(e)):
    x.append(o[i]+e[i])
  x.append(a[-1])
print(*x,sep="")

Submission status: Runtime Error

Solution code:
o = input()
e = input()
x = []
if len(o) == len(e):
  for i in range(len(o)):
    x.append(o[i]+e[1])
else:
  for i in range(len(e)):
    x.append(o[i]+e[i])
  x.append(a[-1])
print(*x,sep="")

Submission status: Runtime Error

Solution code:
o = input()
e = input()
x = []
if len(o) == len(e):
  for i in range(len(o)):
    x.append(o[i]+e[1])
else len(o) != len(e):
  for i in range(len(e)):
    x.append(o[i]+e[i])
  x.append(a[-1])
print(*x,sep="")

Submission status: Runtime Error

Solution code:
o = input()
e = input()
x = []
if len(o) = len(e):
  for i in range(len(o)):
    x.append(o[i]+e[1])
else len(o) != len(e):
  for i in range(len(e)):
    x.append(o[i]+e[i])
  x.append(a[-1])
print(*x,sep="")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

print(s)

Submission status: Runtime Error

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