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:
#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;

int main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  string s, t;
  cin >> s >> t;
  int n = s.size() + t.size();
  string ans(n, 'a');
  for (int i = 0; i < s.size(); i++) {
    ans[i * 2] = s[i];
  }
  for (int i = 0; i < t.size(); i++) {
    ans[i * 2 + 1] = t[i];
  }
  cout << ans << endl;
  return 0;
}

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

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

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

    print("".join(pw))

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


if __name__ == "__main__":

    main()

Submission status: Runtime Error

Solution code:
O, E = map(int, input().split())
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)

Submission status: Runtime Error

Solution code:
O,E = map(lambda x: [x2 for x2 in x],input().split())
if len(O) - len(E) == 1:
  E.append("")
print("".join([o+e for o,e in zip(O,E)]))

Submission status: Runtime Error

Solution code:
O,E = map(lambda x: [x2 for x2 in x],input().split())
if len(O) - len(E) == 1:
  E.append("")
print("".join([o+e for o,e in zip(O,E)]))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
o = input().rstrip()
e = input().rstrip()
if len(e) < len(o):
  e.append('')

ans = ''
for l1, l2 in zip(o, e):
  ans = ''.join([ans, l1, l2])

print(ans)

Submission status: Runtime Error

Solution code:
import bisect
import os
from collections import Counter, deque
from fractions import gcd
from functools import lru_cache
from functools import reduce
import functools
import heapq
import itertools
import math
import numpy as np
import re
import sys
import string

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

sys.setrecursionlimit(2147483647)
INF = float("inf")

#
# A, B, C = list(map(int, sys.stdin.readline().split()))
# a = A
# ok = False
# for _ in range(1000):
#     ok |= a % B == C
#     a += A
# if ok:
#     print('YES')
# else:
#     print('NO')
#
#
# A, B = [int(sys.stdin.readline()) for _ in range(2)]
# if A>B:
#     print('GREATER')
# elif A<B:
#     print('LESS')
# else:
#     print('EQUAL')


O, E = [sys.stdin.readline().rstrip() for _ in range(2)]
ans = ''
for i in range(len(O)):
    ans += O[i]
    ans += E[i]

print(ans)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

tail = len(O) - len(E)

print("".join((x + y for x, y in zip([O, O[:-1]][tail], E) + ["", O[-1]][tail])

Submission status: Runtime Error

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

tail = len(E) - len(O)

print("".join((x + y for x, y in zip([O, O[:-1]][tail], E) + ["", O[-1]][tail])

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

print(ans)

Submission status: Runtime Error

Solution code:
O = str(input())
E = str(input())
n = 0
K = O[0]
while True:
  if(len(K)%2==1):
    K+=E[n]
  else:
    n+=1
    K+=O[n]
print(K)

Submission status: Runtime Error

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

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

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:
from functools import reduce
import math

def main():
    # N! を求める
    # f = math.factorial(N)
    
    # 切り捨て
    # 4 // 3
    # 切り上げ
    #-(-4 // 3)
    
    # 初期値用:十分大きい数(100億)
    # 1e10

    # 初期値用:十分小さい数(-100億)
    # -1e10
    
    # 1文字のみを読み込み
    # 入力:2
    # a = input().rstrip()
    # 変数:a='2'
    
    # スペース区切りで標準入力を配列として読み込み
    # 入力:2 4 5 7
    # a, b, c, d = (int(_) for _ in input().split())  
    # 変数:a=2 b=4 c=5 d =7
    
    # 1文字ずつ標準入力を配列として読み込み
    # 入力:2 4 5 7
    # a = list(int(_) for _ in input().split())
    # 変数:a = [2, 4, 5, 7]    

    # 1文字ずつ標準入力を配列として読み込み
    # 入力:2457
    # a = list(int(_) for _ in input())
    # 変数:a = [2, 4, 5, 7]    
    O = list(_ for _ in input())
    E = list(_ for _ in input())
    ans = []
    for i in range(len(O)):
        ans.append(O[i])
        ans.append(E[i])
    print(''.join(ans))
    
if __name__ == '__main__':
    main()

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s1 = input()
s2 = input()
password = ''.join([i,j for i, j in zip(s1, s2)])
print(password)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
lo=list(input())
le=list(input())
l==""
for i in range(len(le)):
  l+=lo[i]
  l+=le[i]
if len(le)==len(lo):
  print(l)
else:
  print(l+lo[-1])

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
o=input()
e=input()
j,k=0,0
for i in range(len(o)+len(e)):
  if i %2:
    res+=e[k]
    k+=1
  else:
    res+=o[j]
    j+=1
print(res)

Submission status: Runtime Error

Solution code:
o,e = map(str, raw_input().split())
s = ""
for i in range(len(o)):
	s += o[i]+e[i]
print s

Submission status: Runtime Error

Solution code:
o,e = map(str, raw_input().split())
s = ""
for i,j in o,e:
	s += i
	s += j
print s

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

s = ''

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

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

print(s)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
a=input()
b=input()
c=a+b
d=""
for i in len(c)//2:
  d+=(c[i])
  d+=(c[len(c)//2+i])
print(d)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
o=input()
e=input()
l=0
if abs(o-e)==0:
    for i in range(len(e)):
        l+=o[i]+e[i]
    print(l)
else:
    for j in range(len(e)):
        l+=o[i]+e[i]
    l+=o[len(e)]
    print(l)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

a = ''

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

b=[]

if(len(O)>len(E)):
    X=O
else:
    X=E

for i in range(len(X)):
    b.append(O[i])
    b.append(E[i])

a=str(b)

a=a.replace("'","")
a=a.replace(",","")
a=a.replace(" ","")
a=a.replace("[","")
a=a.replace("]","")



print(a)

Submission status: Runtime Error

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

from itertools import zip_longest


def solve():
    o = input()
    e = input()
    for l, r in zip_longest(o, e):
        if r is None:
            r = ""
        print(f'{l}{r}', end="")


if __name__ == '__main__':
    solve()

Submission status: Runtime Error

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

int main() {
  string O, E;
  cin >> O >> E;
  E[E.size() - 1] =='';
  for (int i = 0; i < O.length(); i++) {
    cout << O[i] << E[i] << flush;
  }
  cout << endl;
}

Submission status: Runtime Error

Solution code:
a = list(input())
b = list(input())
c = []

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

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

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

Submission status: Runtime Error

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

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

if len(O) > len(E):
    ans += O[i]
elif len(O) < len(E):
    ans += E[i]

print(ans)

Submission status: Runtime Error

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

ans = ''
for i in range(min(O, E)):
    ans += O[i]
    ans += E[i]

if len(O) > len(E):
    ans += O[i]
elif len(O) < len(E):
    ans += E[i]

print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

ans = []
while True:
    if O == []:
        break
    ans.append(O.pop(0))
    if E == []:
        break
    ans.append(E.pop(0))

print("".join(ans))

Submission status: Runtime Error

Solution code:
O = list(input())
E = list(input())
llist = list(range(1, len(E)+3, 2))
for i in range(len(E)):
    O.insert(llist[i],E[i] )
print(''.join(O))

Submission status: Runtime Error

Solution code:
#58b
o = input()
e = input()
ans=[]
for i in range(len(o)):
    ans.append(o[i]+e[i])
print(''.join(ans))

Submission status: Runtime Error

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

password = [0 for _ in range(len(O) + len(E))]

for i in range(len(O)):
    password[2 * i] = O[i]

for i in range(len(E)):
    password[2 * i + 1] = E[i]

password_str = ''.join(str_list)
print(password_str)

Submission status: Runtime Error

Solution code:
odd, even = input(), input()

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

print("")

Submission status: Runtime Error

Solution code:
o = input()
e = input()
counter = 0
ans = ""
while len(o) > counter:
    ans = str(ans) + o[counter] + e[counter]
    counter+=1
print(ans)

Submission status: Runtime Error

Solution code:
o = input()
e = input()
ans = []
n = len(o)
i = 0
while i < n:
	ans.append(o[i])
	ans.append(e[i])
	i+=1
for i in range(len(ans)):
	if i != len(ans)-1:
		print(ans[i],end="")
	else:
		print(ans[i])

Submission status: Runtime Error

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

res = ''

for (o, e) in O.zip(E):
  res += o
  res += e
  
print(res)

Submission status: Runtime Error

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

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

if len(E)%2 == 1:
    print(password)
else:
    password = password + O[len(O)]
    print(password)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

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

Submission status: Runtime Error

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

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a,b=input(),input()
l=len(a+b)
ans=""
for i in range(l):
  if i % 2 == 0:
    ans += a.pop(0)
  else:
    ans += b.pop(0)
print(ans)

Submission status: Runtime Error

Solution code:
a,b=input(),input()
l=len(a+b)
ans=""
for i in range(l):
  if l % 2 == 0:
    ans += a.pop(0)
  else:
    ans += b.pop(0)
print(ans)

Submission status: Runtime Error

Solution code:
o = list(input())
e = list(input())
l = []
for x in range(max(len(o), len(e))):
    l.append(o[x])
    l.append(e[x])
print(''.join(l))

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>

using namespace std;

int main() {
  string o, e;
  cin >> o >> e;
  for (int i = 0; i < o.size(); i++) {
    cout << o[i] << e[i];
  }
  if (o.size() > e.size()) 
    cout << o[o.size()];
  cout << '\n';
  return 0;
}

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

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:
O = input()

E = input()

Ans = ""

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

Submission status: Runtime Error

Solution code:
import sys
a = []
b = []
a = input()
b = input()

for num in range(0,len(a)):
   sys.stdout.write(a[num])
   sys.stdout.write(b[num])

Submission status: Runtime Error

Solution code:
O,E=[input().rstrip() for _ in range(2)]
for i in range(len(O)):
    print(O[i]+E[i],end="")

Submission status: Runtime Error

Solution code:
N = int(input())
Ts = list(map(int, input().split()))
M = int(input())
Ds = []
O = str(input())
E = str(input())

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

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

Submission status: Runtime Error

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

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

for i in range(ma):
    if (i < len(O)):
        print(O[i], end="")
    if (i < len(E)):
        print(E[i], end="")
----

Submission status: Runtime Error

Solution code:
O = [i for i in input()]
E = [i for i in input()]
psw = ''

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

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


print(psw）

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
# coding: utf-8

if __name__ == '__main__':
    a,b,c = map(int,input().split())
    if b-a == c-b:
        print("Yes")
    else:
        print("No")

Submission status: Runtime Error

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

password = O[0] + E[0]

if len(O)-len(E)==1:
    for i in range(1, len(O)-1):
        password = password + O[i] + E[i]
    password = password + O[i]
else:
    for i in range(1, len(O)):
        password = password + O[i] + E[i]

print(password)

Submission status: Runtime Error

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

password = []

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

print(password)

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
# 整数の入力
A=input()
B=input()
ans=str()
if len(A)==len(B):
  for i in range (0,len(A)):
    ans+=A[i]+B[i]
else:
  for i in range (0,len(A)):
    ans+=A[i]+B[i]
  ans+=A[-1]
print(ans)

Submission status: Runtime Error

Solution code:
so=input()
se=input()
sol=list(so)
sel=list(se)
i=0
while i<len(sol) or i<len(sel):
    s.append(sol[i])
    s.append(sel[i])
    i=i+1
print "".join(s)

Submission status: Runtime Error

Solution code:
a=input();b=input();r=[];l=len(lb)
for i in range(l):
    r.append(a[i]); r.append(b[i])
if l != len(a):
    r.append(a[-1])
print(''.join(r))

Submission status: Runtime Error

Solution code:
a=input();b=input();r=[];l=len(lb)
for i in range(l):
    r.append(a[i]); r.append(b[i])
if l != len(b):
    r.append(a[-1])
print(''.join(r))

Submission status: Runtime Error

Solution code:
O = input()
E = input()
s = ''
while O or E:
    if len(E) >= len(O):
        s = E.pop() + s
    else:
        s = O.pop() + s
print(s)

Submission status: Runtime Error

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

n = len(s);
for i in range(n) :
	print(s[i], end="");
	print(t[i], end="");
print("");

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:
import itertools
O, E = raw_input().split()
seq = []
for x, y in itertools.izip_longest(O, E):
    if x: seq.append(x)
    if y: seq.append(y)
print ''.join(seq)

Submission status: Runtime Error

Solution code:
O=str(input())
E=str(input())
K=''
for i in range(0,len(O)):
    K=K+O[i]+E[i]
print(K)

Submission status: Runtime Error

Solution code:
a=list(input())
b=list(input())
d=""
for i in range(0,len(b)):
    c=a[i]+b[i]
    d=d+c
    if len(b)+1 == len(a):
        d = d+ a[len(a)]
print(d)

Submission status: Runtime Error

Solution code:


a=list(input())
b=list(input())
d=""
for i in range(0,len(a)):
    c=a[i]+b[i]
    d=d+c
print(d)

Submission status: Runtime Error

Solution code:


a=list(input())
b=list(input())
d=""
for i in range(0,len(a)):
    c=a[i]+b[i]
    d=d+c
print("d")

Submission status: Runtime Error

Solution code:
import numpy as np

a=list(input))
b=list(input))
c=[]
for i in range(0,len(a)+len(b)):
    c=np.append(c,a[i]+b[i],axis=0)
print("c")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
# 文字列の入力
O = input()
E = input()

L = len(O)
TMP = ""

for i in range(L):
    TMP = TMP+O[i]+E[i]

print(TMP)

Submission status: Runtime Error

Solution code:
# 文字列の入力
O = char(input())
E = char(input())

L = len(O)
TMP = ""

for i in range(L):
    TMP = TMP+O[i]+E[i]

print(TMP)

Submission status: Runtime Error

Solution code:
a=input()
b=input()
s=[]
for i in range(a):
    s=append(s,a(i),b(i))

Submission status: Runtime Error

Solution code:
# 文字列の入力
O = char(input())
E = char(input())

L = len(O)
TMP = ""

for i in range(L):
    TMP = str(TMP+O[i]+E[i])

print(TMP)

Submission status: Runtime Error

Solution code:
# 文字列の入力
O = char(input())
E = char(input())

L = len(O)
TMP = ""

for i in 0:L:
    TMP = str(TMP+O[i]+E[i])

print(TMP)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
kisuu = raw_input()
char_kisuu = list(kisuu)
guusuu = raw_input()
char_guusuu = list(guusuu)
x = len(char_kisuu)
y = len(char_guusuu)
p = 0
q = 0
hukugen = []

for cnt in range(x + y):
    if (cnt + 1) % 2 == 1:
        hukugen.append(char_kisuu[p])
        p += 1
    if (cnt + 1) % 2 == 0:
        hukugen.append(char_guusuu[q])
        q += 1
print "".join(hukugen)

Submission status: Runtime Error

Solution code:
n=input()
m=input()
n=n[::2]
m=m[1::2]
if len(n)>len(m):
	m+" ")
elif len(n)<len(m):
	n+" ")
else:
	pass

s=""
for i in range(len(m)):
	s=s + n[i] + m[i]

print(s.strip())

Submission status: Runtime Error

Solution code:
s_vec1 = input()
s_vec2 = input()
def abc_057_2(o,e):
    s_vec3 = []
    for i in range(0,len(o)):
    s_vec3.append(o[i])
    s_vec3.append(e[i])
    if len(o) == len(e):
        pass
    else:
        s_vec3.append(o[i+1])
    return(''.join(s_vec3))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
so=input()
se=input()
sol=list(so)
sel=list(se)
i=0
while i<len(sol) or i<len(sel):
    s.append(sol[i])
    s.append(sel[i])
    i=i+1
print "'.join(s)

Submission status: Runtime Error

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

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

if len(e)<len(o):
        print(o[len(o)])

print("")

Submission status: Runtime Error

Solution code:
O = raw_input()
E = raw_input()
out = O+E
for count in range(0,len(out)/2):
	out[2*count] == O[count]
	out[2*count+1] == E[count]
if len(O) > len(E):
	out[2*count+2] = O[count+1]
print out

Submission status: Runtime Error

Solution code:
O=input()
E=input()
ol=len(O)
el=len(E)
if ol>=el:
    for num in range(0,ol):
        print(O[num]+E[num])
else :
    for num in range(0, el):
        print(O[num] + E[num])

Submission status: Runtime Error

Solution code:
O = raw_input()
E = raw_input()
out = O+E
out[::2] = E
out[1::2] = O

Submission status: Runtime Error

Solution code:
O = map(int, raw_input().split())
E = map(int, raw_input().split())
out = O+E
out[::2] = E
out[1::2] = O

Submission status: Runtime Error

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


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

print("")

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

    if len(E) % 2 != 0:
        E.append('')

    i = 0
    passwd = ''
    while i < len(O):
        passwd = passwd + O[i] + E[i]
        i += 1
    print(passwd)

main()

Submission status: Runtime Error

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

num = len(o)
if num%2==0:
    for n in range(num):
        ans += o[n] + e[n]
else:
    for n in range(num):
        ans += o[n] + e[n]
    ans += o[num-1]
print(ans)

Submission status: Runtime Error

Solution code:
o = input().split("")
e = input().split("")
j = 0
k = 0
ans = ""
for i in range(len(o) + len(e)):

Submission status: Runtime Error

Solution code:
import sys

input = [sys.argv[1],sys.argv[2]]

result = ""
n = len(input[1])
for i in range(0,n):
	result = result + input[0][i] + input[1][i]

if len(input[0])>n:
	result = result + input[0][-1]

print(result)

Submission status: Runtime Error

Solution code:
import sys

input = sys.argv[1].strip().split("\n")
result = ""
n = len(input[1])
for i in range(0,n):
	result = result + input[0][i] + input[1][i]

if len(input[0])>n:
	result = result + input[0][-1]

print(result)

Submission status: Runtime Error

Solution code:
#! -*- coding:utf-8 -*-
O = str(input())
E = str(input())
O = list(O)
E = list(E)
n = 0
arr = []
for i in range(len(O)*2):
    if n % 2 == 0:
        arr.append(O.pop(0))
    else:
        arr.append(E.pop(0))
    n += 1
    
for i in range(len(arr)-1):
    print(arr[i],end = '')
print(arr[-1])

Submission status: Runtime Error

Solution code:
O = list(input())
E = list(input())
password = []
if len(O) - len(E) == 0:
    for i in range(len(O)):
        password.append(O[i])
        password.append(E[i])
elif len(O) - len(E) == 1:
    for i in range(len(E)):
        password.append(O[i])
        password.append(E[i])
    password.append(O[len(O)])
password = "".join(password)

print(password)