Problem:


Score : 200 points

Problem Statement

You are given a string s consisting of lowercase English letters. Extract all the characters in the odd-indexed positions and print the string obtained by concatenating them. Here, the leftmost character is assigned the index 1.

Constraints

Each character in s is a lowercase English letter.

1≤|s|≤10^5

Input

The input is given from Standard Input in the following format:

s

Output

Print the string obtained by concatenating all the characters in the odd-numbered positions.

Sample Input 1

atcoder

Sample Output 1

acdr

Extract the first character a, the third character c, the fifth character d and the seventh character r to obtain acdr.

Sample Input 2

aaaa

Sample Output 2

aa

Sample Input 3

z

Sample Output 3

z

Sample Input 4

fukuokayamaguchi

Sample Output 4

fkoaaauh



Sample input:
atcoder


Sample output:
acdr

Submission status: Accepted

Solution code:
# abc072B
# https://atcoder.jp/contests/abc072/tasks/abc072_b

# 英小文字からなる文字列 s
# 前から奇数文字目だけを抜き出し文字列を出力
# 先頭の文字を１文字目とする


# 入力
s = str(input())

# 処理
# 奇数番目文字の抜き出し
print(s[::2])

Submission status: Accepted

Solution code:
s = str(input())

for i in range(len(s)):
    if i % 2 == 0:
        print(s[i], end = '')  #endの入れ方がまだよくわからん

Submission status: Accepted

Solution code:
s = input()
s.split()
odd = []

for i in range(len(s)):
    if i % 2 == 0:
        odd.append(s[i])
answer = ''.join(odd)

print(answer)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

print(s[0::2])

Submission status: Accepted

Solution code:
# B - OddString

# 英小文字からなる文字列sの、奇数文字目を抜き出した文字列を出力する
# 先頭の文字を1文字目とする

s = input()

print(s[0:len(s)+1:2])

Submission status: Accepted

Solution code:
s = list(input())

print(''.join(s[0::2]))

Submission status: Accepted

Solution code:
S = list(input())

new_list = ""

for i in range(len(S)):
    if i % 2 == 0:
        new_list += S[i]

print(new_list)

Submission status: Accepted

Solution code:
# B - OddString

# s
s = input()
j = 0
m = ''
for i in s:
    j += 1
    if j % 2 == 1:
        m += i

print(m)

Submission status: Accepted

Solution code:
words = str(input())
print(words[0::2])

Submission status: Accepted

Solution code:
s = input()
for i in range(0, len(s), 2):
    print(s[i], end="")

Submission status: Accepted

Solution code:
print(input()[::2])

Submission status: Accepted

Solution code:
S = list(input())
N = len(S)
T = []
for i in range(N):
    if i%2==0:
        T.append(S[i])
print("".join(T))

Submission status: Accepted

Solution code:

s = list(input()) #１文字ずつ

out=[]
for i in range(len(s)):
    if i%2==0:
        out.append(s[i])

print(''.join(out))

Submission status: Accepted

Solution code:
s = input()
# print(s)
n: int = 0
odds = ""


for i in s:
    if n % 2 == 0:
        odd = s[n]
        odds += odd
    elif n == 0:
        odd = s[n]
        odds += odd
    else:
        pass
    n += 1
    # nを奇数にする
print(odds)

Submission status: Accepted

Solution code:
#   OddString

in_s = list(input())

out_ss = ""

for i, new in enumerate(in_s):
    if i % 2 == 0:
        out_ss += new

print(out_ss)

Submission status: Accepted

Solution code:
s = input()
n_s =''
for n in range(0,len(s),2):
    n_s = n_s + s[n]

print(n_s)

Submission status: Accepted

Solution code:
s = input()

for i in range(0, len(s), 2):
    print(s[i], end="")

Submission status: Accepted

Solution code:
s = input()
print(s[0: :2])

Submission status: Accepted

Solution code:
s = input()
for i in range(0, len(s), 2):
  print(s[i], end = "")

Submission status: Accepted

Solution code:
s = list(input())
del s[1::2]
print("".join(s))

Submission status: Accepted

Solution code:
# B - OddString
# https://atcoder.jp/contests/abc072/tasks/abc072_b

s = input()

result = ''
i = 0
while i < len(s):
    result += s[i]
    i += 2

print(result)

Submission status: Accepted

Solution code:
s = input ()
odd_num = list()

for i in range(len(s)):
    if i % 2 == 0:
        odd_num.append(s[i])

answer = "".join(odd_num)
print(answer)

Submission status: Accepted

Solution code:
s = input()
odd_num = list()

for i in range(len(s)):

    if i % 2 == 0:
        odd_num.append(s[i])

answer = ''.join(odd_num)
print(answer)

Submission status: Accepted

Solution code:
def answer(s: str) -> str:
    return s[::2]


def main():
    s = input()
    print(answer(s))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
S = str(input())
ls = len(S)
odd_list = []
result = ""

while ls > 0:
    ls -= 1
    if ls % 2 == 0:
        odd_list.append(ls)
odd_list = sorted(odd_list)
# print(odd_list)

for i in odd_list:
    result = result + S[i]
print(result)

Submission status: Accepted

Solution code:
S = str(input())
print(S[::2])

Submission status: Accepted

Solution code:
s = input()

s_odd = []
for i in range(0, len(s)):
    if i % 2 == 0:
        s_odd.append(s[i])

print("".join(s_odd))

Submission status: Accepted

Solution code:
# 072b
class Atc_072b:
    def __init__(self, s: str) -> str:
        self.s = s

    def odd(self):
        s_odd = ""
        for i in range(0, len(self.s)):
            if i % 2 == 0:
                s_odd += self.s[i]
        return s_odd


s_input = input()
print(Atc_072b(s_input).odd())

Submission status: Accepted

Solution code:
S = input()
S = S[0::2]
print(S)

Submission status: Accepted

Solution code:
# 偶数文字の除外
s = list(input())

# print(s[0::2])  # ::は二つ刻みで表示できるって意味らしい

print(''.join(s[0::2]))

Submission status: Accepted

Solution code:
s = str(input())
 
print(s[::2])

Submission status: Accepted

Solution code:
s = input()
print(s[0:len(s)+1:2])

Submission status: Accepted

Solution code:
s = (input())
print(s[::2])

Submission status: Accepted

Solution code:
# 072b
class Atc_072b:
    def __init__(self, s: str) -> str:
        self.s = s

    def odd(self):
        s_odd = ""
        for i in range(0, len(self.s)):
            if i % 2 == 0:
                s_odd += self.s[i]
        return s_odd
    

s_input = input()
print(Atc_072b(s_input).odd())

Submission status: Accepted

Solution code:
#072_b
s = input()
a = []
if s.islower() and 1 <= len(s) and len(s) <= 10 ** 5:
    b=""
    for n in range(len(s)):
        if n % 2 == 0:
            a.append(s[n])
    for m in range(len(a)):
        b=b+a[m]
    print(b)

Submission status: Accepted

Solution code:
s = list(input())

for i in range(0, len(s)):
    if i % 2 == 0:
        print(s[i], end = "")

Submission status: Accepted

Solution code:
# 文字の取得
ori_str = str(input())
strnum = len(ori_str)

# 奇数文字だけを抜き出して出力
odd_str = ""
for cnt in range(0,strnum,2):
    odd_str += ori_str[cnt]
print(odd_str)

Submission status: Accepted

Solution code:
word = input()
test = [n for i, n in enumerate(word) if i % 2 == 0]
print(''.join(test))

Submission status: Accepted

Solution code:
s = input()
ans = []
for i in range(len(s)):
    if i % 2 == 0:
        ans.append(s[i])
a = map(str, ans)
print(''.join(a))

Submission status: Accepted

Solution code:
s=str(input())

def ans072(s:str):
    ans_str=""
    for i in range(0,len(s)):
        if i%2==0:
            ans_str=ans_str+s[i]
    return ans_str

print(ans072(s))

Submission status: Accepted

Solution code:
s = input()

count = 0
result = ""

for x in s:
    count = count +1
    if count % 2 == 1:
        result = result + x
else:
    print(result)

Submission status: Accepted

Solution code:
a = list(input())

for i in range (0, len(a)):
    if i % 2 == 0:
        print(a[i], end = "")

Submission status: Accepted

Solution code:
list_s = list(input())
print("".join(list_s[::2]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
for i in range(0,len(s),2):
  print(s[i],end="")

Submission status: Accepted

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

for i in range(1,len(s)+1):
  if i % 2 == 1:
    t += s[i-1]
    
print(t)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#072B
s=list(input())
data=s[0]
i=1
while i*2<len(s):
    data=data+s[i*2]
    i=i+1
print(data)

Submission status: Accepted

Solution code:
#ABC167A
s = input()
print(s[::2])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

res = ''
for i, elem in enumerate(s):
  if i % 2 == 0:
    res += elem
print(res)

Submission status: Accepted

Solution code:
n=input()
a = []
a.append(str(n[:len(n):2]))
print(*a)

Submission status: Accepted

Solution code:
S = input()
print(S[::2])

Submission status: Accepted

Solution code:
S = list(input())
ans = []
for i in range(1,len(S) + 1,2):
    ans.append(S[i - 1])
print("".join(ans))

Submission status: Accepted

Solution code:
S = input()
print("".join([s for i,s in enumerate(S) if i%2==0]))

Submission status: Accepted

Solution code:
s = input()
res = ""
for i in range(len(s)):
    if i % 2 == 0:
        res += s[i]

print(res)

Submission status: Accepted

Solution code:
s=input()
print(s[::2])

Submission status: Accepted

Solution code:
s = list(input())
s_join = "".join(s[0::2])
print(s_join)

Submission status: Accepted

Solution code:
s = str(input())

ans = ""
for i in range(0,len(s),2):
    ans += s[i]

print(ans)

Submission status: Accepted

Solution code:
A=input()
print(A[::2])

Submission status: Accepted

Solution code:
s = input()

s_list = list(s)

mojiretu = ''.join(s_list[0::2])

print(mojiretu)

Submission status: Accepted

Solution code:
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


def main():
    s = input()
    print(s[::2])


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
s = sys.stdin.readline().rstrip("\n")
i = 0
ans = ''
for m in s:
    if i % 2 == 0:
        ans += m
    i += 1
print(ans)

Submission status: Accepted

Solution code:
import sys
def S(): return sys.stdin.readline().rstrip()


S = S()
print(S[::2])

Submission status: Accepted

Solution code:
import sys
def LS2(): return list(sys.stdin.readline().rstrip())  #空白なし


S = LS2()
ans = ''
for i in range(0,len(S),2):
    ans += S[i]

print(ans)

Submission status: Accepted

Solution code:

# ABC072
S = input()
for i in range(len(S)):
    if i % 2 == 0:
        print(S[i], end="")
print()

Submission status: Accepted

Solution code:
s = input()

ans = ''
for i in range(len(s)):
    if i % 2 == 0:
        ans += s[i]

print(ans)

Submission status: Accepted

Solution code:
s = input()
ans = ''
for i in range(0,len(s),2):
    ans += s[i]
print(ans)

Submission status: Accepted

Solution code:
s=str(input())
p=""
for i in range(len(s)):
  if i%2==0:
    p=p+s[i]

print(p)

Submission status: Accepted

Solution code:
S = input()

for s in S[::2]:
    print(s, end='')

Submission status: Accepted

Solution code:
s = input()
for i in range(len(s)):
    if i%2 == 0:
        print(s[i], end='')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()
ans=""
for i in range(0,len(s),2):
  ans+=s[i]
print(ans)

Submission status: Accepted

Solution code:
n=input()
print(n[::2])

Submission status: Accepted

Solution code:
s = list(input())

ans = []
for i in range(len(s)):
    if i % 2 == 0:
        ans.append(s[i])

print(''.join(ans))

Submission status: Accepted

Solution code:
s = input()

ans = ""

for i in range(len(s)):
    if i % 2 == 0:
        ans += s[i]
print(ans)

Submission status: Accepted

Solution code:
n = input()
print(n[::2])

Submission status: Accepted

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

s = list(input())

output=""
for i,ss in enumerate(s):
    if i % 2 == 0:
        output += ss

print(output)

Submission status: Accepted

Solution code:
# vim: fileencoding=utf-8


def main():
    s = input()
    print(s[0::2])


if __name__ == "__main__":
    main()

Submission status: Accepted

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


def main():
    print(input()[0::2])


main()

Submission status: Accepted

Solution code:
S = input()

answer = "".join([c for i, c in enumerate(S) if (i+1) % 2 == 1])
print(answer)

Submission status: Accepted

Solution code:
s = input()
l = []

for i in range(0,len(s),2):
    l.append(s[i])

print(''.join(l))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()

s_odd = ""

for i in range(0,len(s),2):
    s_odd+=s[i]
    
print(s_odd)

Submission status: Accepted

Solution code:
s=input()

s_odd = s[0::2]
print(s_odd)

Submission status: Accepted

Solution code:
# coding: utf-8

str = input()
table = list(str)

for i in range(0, len(str), 2):
  print(table[i], end ='')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    print(input()[::2])


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s = input()

i = 1
ans = ''
for x in s:
    if i & 1:
        ans += x
    i += 1
print(ans)

Submission status: Accepted

Solution code:
s = str(input())
s2 = ""

for i in range(len(s)):
    if i % 2 == 0:
        s2 += s[i]

print(s2)

Submission status: Accepted

Solution code:
l=list(input())
ans=""
for i in range(len(l)):
  if i%2==0:
    ans+=l[i]
       
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

l = []
for i in range (len(s)):
    if (i+1) % 2 == 1:
        l.append(s[i])
        
print("".join(l))

Submission status: Accepted

Solution code:
s = input()

a = []
for i in range(len(s)):
    if (i+1) % 2 == 1:
        a.append(s[i])

print("".join(a))

Submission status: Accepted

Solution code:
s = input()
l = len(s)
o = l//2
S = ''

if l%2== 0:
    for i in range(o):
        S += s[2*i]
if l%2 == 1:
    for i in range(o+1):
        S += s[2*i]

print(S)

Submission status: Accepted

Solution code:
a=input()
n=[]
for i in range(len(a)):
  if i%2==0:
    n.append(i)
ans=''
for i in n:
  ans=ans+a[i]
print(ans)

Submission status: Accepted

Solution code:
s = input()
l = []
for i in range(len(s)):
    if i % 2 == 0:
        l.append(s[i])

print(''.join(l))

Submission status: Accepted

Solution code:
s = input()
s_list = list(s)
l = len(s_list)
k = []

for i in range(0,l,2):
    k.append(s_list[i])

s_joined = ''.join(k)

print("{}".format(s_joined))

Submission status: Accepted

Solution code:
S=input()
print(S[::2])

Submission status: Accepted

Solution code:
s=input()
print(s[0::2])

Submission status: Accepted

Solution code:
S = input()

flag = True
ans = ""
for s in S:
    if flag:
        ans += s
    flag = not flag
print(ans)

Submission status: Accepted

Solution code:
s = str(input())
print(s[0::2])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
for i in range(0, len(s), 2):
    print(s[i], end='')

Submission status: Accepted

Solution code:
s = list(map(str, input()))
ans = ''
for i in range(len(s)):
  if (i+1)%2==1:
	  ans += s[i]

print(ans)

Submission status: Accepted

Solution code:
S=str(input())
ans=""
for i in range(0,len(S),2):
    ans+=S[i]
print(ans)

Submission status: Accepted

Solution code:
n = input()
ans = ""
for i in range(len(n)):
    if i % 2 == 0:
        ans += n[i]
print(ans)

Submission status: Accepted

Solution code:
import sys
s = list (input ())
t = (s[::2])
for i in range (len(t)):
  sys.stdout.write(t[i])
  sys.stdout.flush()

Submission status: Accepted

Solution code:
s=list(input())

for i in range(len(s)):
  if i%2==1:
    s[i]=''
  
ss=''.join(map(str,s))

print(ss)

Submission status: Accepted

Solution code:
s = list(input())
ans = ''
for i in range(len(s)) :
    if i%2 == 0 :
        ans += s[i]

print(ans)

Submission status: Accepted

Solution code:
S = input()
List = []
for i in range(len(S)):
    if i % 2 == 0:
        List.append(S[i])
print(''.join(List))

Submission status: Accepted

Solution code:
s = input()

t = ''
for i in range(0, len(s), 2):
    t += s[i]
print(t)

Submission status: Accepted

Solution code:
s = input()
#print(s[1])
#print(s[2])
i = list(range(0,len(s)+1,2))
temp =""
for t in range((len(s)+1)//2):
    temp = temp+s[i[t]]

print(temp)

Submission status: Accepted

Solution code:
s = list(input())
ans = []
for i in range(len(s)):
    if i%2 ==0:
        ans.append(s[i])
print("".join(ans))

Submission status: Accepted

Solution code:
s = input()
l = len(s)
ans = ""
for i in range(l):
  if i %2==0:
    ans += s[i]
print(ans)

Submission status: Accepted

Solution code:
s = list(input())
ans = ""
for i in range(len(s)):
  if i % 2 == 0:
    ans += s[i]
print(ans)

Submission status: Accepted

Solution code:
s = input()

ans = ''
for i in range(len(s)):
    if i % 2 == 0:
        ans += s[i]
print(ans)

Submission status: Accepted

Solution code:
s = input() 
ans = s[::2]
print(ans)
#ans = ans.join(

Submission status: Accepted

Solution code:
#
# abc072 b
#
import sys
from io import StringIO
import unittest


class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)

    def test_入力例_1(self):
        input = """atcoder"""
        output = """acdr"""
        self.assertIO(input, output)

    def test_入力例_2(self):
        input = """aaaa"""
        output = """aa"""
        self.assertIO(input, output)

    def test_入力例_3(self):
        input = """z"""
        output = """z"""
        self.assertIO(input, output)

    def test_入力例_4(self):
        input = """fukuokayamaguchi"""
        output = """fkoaaauh"""
        self.assertIO(input, output)


def resolve():
    print(input()[0::2])


if __name__ == "__main__":
    # unittest.main()
    resolve()

Submission status: Accepted

Solution code:
s = input()
list = [] 
answer = ""

for i, j in enumerate(s):
    if i % 2 == 0:
        list.append(j)
    else:
        pass

print("".join(list))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

ans = []
for i in range(len(s)):
    if i % 2 == 0:
        ans += s[i]

print(*ans,sep="")

Submission status: Accepted

Solution code:
ans=[]
c=1
for i in input():
  if(c%2==1):ans.append(i)
  c+=1
print(''.join(ans))

Submission status: Accepted

Solution code:
s = str(input())
ans = ''
for i in range(0,len(s),2):
    ans += s[i]
print(ans)

Submission status: Accepted

Solution code:
s = list(input())

moji = []
if len(s)%2 == 0:
    for i in range(len(s)//2):
        moji.append(s[2*i])
else:
    for i in range((len(s)+1)//2):
        moji.append(s[2*i])
print("".join(moji))

Submission status: Accepted

Solution code:
#n = int(input())
#a, b = map(int,input().split())
#l = list(map(int,input().split()))
#l = [list(map(int,input().split())) for i in range(n)]
s = list(input())
ans = ''
for i, si in enumerate(s):
    if (i+1) % 2 != 0:
        ans += si
print(ans)

Submission status: Accepted

Solution code:
def main():
	s = input()

	n = len(s)
	ans = ""

	for i in range(0, n, 2):
		ans += s[i]

	print(ans)


  
if __name__ == "__main__":
  	main()

Submission status: Accepted

Solution code:
s = str(input())
w = ""
for i in range(0,len(s),2):
    w += s[i]
print(w)

Submission status: Accepted

Solution code:
print(''.join([x for i, x in enumerate(input()) if i % 2 == 0]))

Submission status: Accepted

Solution code:
s = str(input())

ans = ''
for i in range(0, len(s), 2):
  ans += s[i]
print(ans)

Submission status: Accepted

Solution code:
#k = int(input())
#s = input()
#a, b = map(int, input().split())
#s, t = map(str, input().split())
#l = list(map(int, input().split()))
#l = [list(map(int,input().split())) for i in range(n)]
#a = [list(input()) for _ in range(n)]
#a = [int(input()) for _ in range(n)]


s = input()

for i in range(len(s)):
    if (i+1) % 2 != 0:
        print(s[i], end="")

Submission status: Accepted

Solution code:
s=input()
t=[]
for i in range(len(s)):
  if i % 2 == 0:t.append(s[i])
print(''.join(t))

Submission status: Accepted

Solution code:
print("".join([s for s in list(input())[0::2]]))

Submission status: Accepted

Solution code:
S  = input()
ans = ''
for i in range((len(S)+1)//2):
    ans += S[2*i]
print(ans)

Submission status: Accepted

Solution code:
print(input()[0::2])

Submission status: Accepted

Solution code:
s = input()
print(s[::2])

Submission status: Accepted

Solution code:
s = input()

ans = []

for n in range(0,len(s),2):
  ans.append(s[n])
print("".join(ans))

Submission status: Accepted

Solution code:
s=input()
for i in range(0, len(s), 2):
  print(s[i], end='')

Submission status: Accepted

Solution code:
s=list(input())
n=len(s)
i=2
ans=s[0]
while i<=n-1:
    ans=ans+s[i]
    i+=2
print(ans)

Submission status: Accepted

Solution code:
s = input()
t=""
for i in range(len(s)):
    if (i+1)%2==1:
        t+=s[i]
print(t)

Submission status: Accepted

Solution code:
s=str(input())
n=len(s)
for i in range(0,n,2):
  print(s[i],end='')
print('')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
print(S[::2])

Submission status: Accepted

Solution code:
s = input()
soutput = []
for i in range(0, len(s)):
    if i % 2 != 1:
        soutput.append(s[i])
        
print("".join(soutput))

Submission status: Accepted

Solution code:
s= input()
ans= ""
for i in range(int((len(s)+ 1)/ 2)):
  ans+= s[i* 2]
  
print(ans)

Submission status: Accepted

Solution code:
s = input()

print(s[::2])

Submission status: Accepted

Solution code:
import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(int,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
s = S()
ans = collections.deque()
odd = True
for c in s:
    if odd:
        ans.append(c)
    odd = not odd
print(''.join(ans))

Submission status: Accepted

Solution code:
# # Make IO faster
# import sys
# input = sys.stdin.readline

# # get single (or) multiple str
# X = input()

# # get single int
# N = int(input())
# # get multiple int (e.g., 2)
# X, Y = map(int, input().split())
# # get multiple int (e.g., 2) for N lines
# XY = [list(map(int, input().split())) for _ in range(N)]

# from IPython import embed; embed(); exit();

# 全部入り
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
import numpy as np
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()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

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

Submission status: Accepted

Solution code:
print("".join(list(input())[::2]))

Submission status: Accepted

Solution code:
s=input()
t=""
for i in range(len(s)):
    if i%2==0:
        t+=s[i]

print(t)

Submission status: Accepted

Solution code:
s = input()
G  = []
for i in range(len(s)):
    if i % 2 == 0:
        G.append(s[i])
StrG = "".join(G)
print(StrG)

Submission status: Accepted

Solution code:
s=input()

print(s[::2])

Submission status: Accepted

Solution code:
import math
s = input()
s = list(s)

if len(s)%2 == 1:
	l = [0]*(len(s)//2 + 1)
	for i in range(len(s)//2 + 1):
		l[i] = s[2*i]
	L = ''.join(l)
	print(L)
else:
	l = [0]*(len(s)//2)
	for i in range(len(s)//2):
		l[i] = s[2*i]
	L = ''.join(l)
	print(L)

Submission status: Accepted

Solution code:
s=list(input())
L=[]
for i in range((len(s)+1)//2):
	L.append(s[2*i])

print(''.join(L))

Submission status: Accepted

Solution code:
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


def main():
    s = readline().strip()
    print(s[::2])
    
    return


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()


def main():
    s = input()
    print(s[::2])

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
S=list(input())
L=list()
for i in range(len(S)):
  if i%2==0:
    L.append(S[i])
print("".join(L))

Submission status: Accepted

Solution code:
N = input()
NN = list(N)
N_l = len(N)

ans = []

for i in range(N_l):
  if i % 2 == 0:
    ans.append(NN[i])
  else:
    pass
    
print(''.join(ans))

Submission status: Accepted

Solution code:
S=[x for x in input()]
print(''.join(S[0::2]))

Submission status: Accepted

Solution code:
s = str(input())

for i in range(len(s)):
  if i % 2 == 0:
    print(s[i], end = "")
    
print("")

Submission status: Accepted

Solution code:
import sys, re
from math import ceil, floor, sqrt, pi, factorial, gcd
from copy import deepcopy
from collections import Counter, deque
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement
from bisect import bisect, bisect_left, bisect_right
from functools import reduce
from decimal import Decimal, getcontext
# input = sys.stdin.readline 
def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_str(N): return [s_list() for _ in range(N)]
def s_row_list(N): return [list(s_input()) for _ in range(N)]
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 6)
INF = float('inf')
MOD = 10 ** 9 + 7
num_list = []
str_list = []

def main():
    S = s_input()

    for i,s in enumerate(S):
        if i % 2 == 1:
            continue
        print(s,end='')

    print()

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#-------------
s = input()
#-------------
if len(s) <= 2:
  print(s[0])

else:
  N = len(s)//2
  q = 0
  if N%2 == 1:
    q=1
  Odd = []
  for i in range(N+q):
    Odd.append(s[2*i])
  Odd = "".join(Odd)
  print(Odd)

Submission status: Accepted

Solution code:
s = input()
ans = ''
for i in range(0, len(s), 2):
    ans += s[i]
print(ans)

Submission status: Accepted

Solution code:
din = str(input())
dout = ""
length = len(din)
for i in range(int(length/2)+int(length%2)):
    dout = dout + din[2*i]
print(dout)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
res = ""
for i in range(0,len(S),2):
  res += S[i]
print(res)

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(4100000)
import math
INF = 10**9

def main():
    S = input()

    print(S[::2])


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N = input()
for i in range(len(N)):
  if i%2 == 0:
    print(N[i],end='')

Submission status: Accepted

Solution code:
s = input()

words = [s[i-1] for i in range(1, len(s)+1, 1) if i%2 != 0]
print(''.join(words))

Submission status: Accepted

Solution code:
s=list(input());res=[]
for i in range(len(s)):
    if i%2==0:res+=s[i]
print("".join(res))

Submission status: Accepted

Solution code:
s = input()

p = list(s)

even = []
odd = []

for i in range(len(p)):
    if (i + 1) % 2 == 1:
        odd.append(p[i])
    else:
        even.append(p[i])

for i in range(len(odd)):
    print(odd[i],end='')

print('')

Submission status: Accepted

Solution code:
answer = ''
for i,c in enumerate(input()):
  if i%2 == 0:
    answer += c
print(answer)

Submission status: Accepted

Solution code:
s=list(input())
ans=[]
for i in range(0,len(s),2):
    ans.append(s[i])

print(*ans,sep="")

Submission status: Accepted

Solution code:
s = input()
print(s[0:len(s)+1:2])

Submission status: Accepted

Solution code:
S = input()

print(S[::2])

Submission status: Accepted

Solution code:
print("".join(input()[::2]))

Submission status: Accepted

Solution code:
print("".join(input()[::2]))

Submission status: Accepted

Solution code:
def actual(s):
    answer = ''

    for idx, c in enumerate(s):
        if idx % 2 == 0:
            answer += c

    return answer

s = input()

print(actual(s))

Submission status: Accepted

Solution code:
def actual(s):
    return s[0::2]

s = input()

print(actual(s))

Submission status: Accepted

Solution code:
s = list(input())
output = []
for i in range(len(s)):
    if i % 2 == 0: output.append(s[i])
print("".join(output))

Submission status: Accepted

Solution code:
s = list(input())
output = []
for i in range(len(s)):
    if i % 2 == 0:
        output.append(s[i])
    else:
        pass
print("".join(output))

Submission status: Accepted

Solution code:
n = str(input())
a = ""
for i in range(0, len(n)):
    if i % 2 == 0:
        a += n[i]

print(a)

Submission status: Accepted

Solution code:
s = input()
n = len(s)

ans = ""
for i in s[::2]:
    ans += i    

print(ans)

Submission status: Accepted

Solution code:
s = input()
ans = ""
for i in range(0, len(s), 2):
    ans += s[i]
print(ans)

Submission status: Accepted

Solution code:
a = input()
c = ''
for i in range(0,len(a),2):
  c = c + a[i]
print(c)

Submission status: Accepted

Solution code:
S = input()
s = []
for i in range(len(S)):
    if i % 2==0:
        s.append(S[i])
print("".join(map(str,s)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
print("".join([s[i] for i in range(0, len(s), 2)]))

Submission status: Accepted

Solution code:
s = input()
for i in range(0, len(s), 2):
    print(s[i], end='')
print('')

Submission status: Accepted

Solution code:
s = input()

s = "".join([c for c, i in zip(s, range(len(s))) if i % 2 == 0])

print(s)