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:
# region header
import sys
import math
from bisect import bisect_left, bisect_right, insort_left, insort_right
from collections import defaultdict, deque, Counter
from copy import deepcopy
from fractions import gcd
from functools import lru_cache, reduce
from heapq import heappop, heappush
from itertools import accumulate, groupby, product, permutations, combinations, combinations_with_replacement
from math import ceil, floor, factorial, log, sqrt, sin, cos
from operator import itemgetter
from string import ascii_lowercase, ascii_uppercase, digits
sys.setrecursionlimit(10**7)
rs = lambda: sys.stdin.readline().rstrip()
ri = lambda: int(rs())
rf = lambda: float(rs())
rs_ = lambda: [_ for _ in rs().split()]
ri_ = lambda: [int(_) for _ in rs().split()]
rf_ = lambda: [float(_) for _ in rs().split()]
INF = float('inf')
MOD = 10 ** 9 + 7
PI = math.pi
# endregion
print(rs()[::2])

Submission status: Accepted

Solution code:
s = str(input())

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

print(ans)

Submission status: Accepted

Solution code:
s = input()

answer_list = []

for i, char in enumerate(s, 1):
    if i % 2 == 1:
        answer_list.append(char)

print("".join(answer_list))

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
s = list(input())

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

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

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

Submission status: Accepted

Solution code:
s = input()

print(''.join([s[i] for i in range(len(s)) if i % 2 == 0]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
i = 0
l = list()
for c in s:
    if (i%2 == 0):
        l.append(c)
    i = i+1
l = "".join(l)
print(l)

Submission status: Accepted

Solution code:
# 4問目類題4
s = list(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 = list(str(input()))
print("".join(s[0::2]))

Submission status: Accepted

Solution code:
s = input()

ans = ""
for i in range(len(s)):
    if i % 2 == 1:
        continue
    else:
        ans+=s[i]

print(ans)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil,sqrt
from operator import itemgetter
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]
def printns(x): print('\n'.join(x))
def printni(x): print('\n'.join(list(map(str,x))))
inf = 10**17
mod = 10**9 + 7
#s=input().rstrip()


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

Submission status: Accepted

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

# N = int(input())
s = input()
# N, K = map(int, input().split())
# A = list(map(int, input().split()))

def main():
    print(s[::2])
if __name__ == "__main__":
    main()

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()
i = 0
r = ''
for t in s:
	if i % 2 == 0:
		r += t
	i += 1
print(r)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin


if __name__ == "__main__":
    _in = [_.rstrip() for _ in stdin.readlines()]
    s =     _in[0]   # type:str
    # vvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvv
    s = ''.join([_s for i,_s in enumerate(s) if i%2==0])
    # ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
    print(s)

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
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
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
import numpy as np

s = input()
 
i = 0
 
while i <= len(s)-1:
	print(s[i], end="")
	i += 2
 
print()

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:
s=input()
res=""
for i in range(0,len(s)):
  if i%2==0:
    res+=s[i]
print(res)

Submission status: Accepted

Solution code:
def resolve():
    # 整数 1 つ
    n = input()
    # 整数複数個
    # a, b, c = list(map(int, input().split()))
    # 整数 N 個 (改行区切り)
    # N = [int(input()) for i in range(N)]
    # 整数 N 個 (スペース区切り)
    # N = list(map(int, input().split()))
    # 整数 (縦 H 横 W の行列)
    # A = [list(map(int, input().split())) for i in range(H)]

    r=""
    for i in range(1, len(n)+1):
        if i % 2 == 1:
            r = r + n[i-1]

    print(r)

resolve()

Submission status: Accepted

Solution code:
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections

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()
l = [S[i] for i in range(0,len(S),2)]
a = "".join(l)
print(a)

Submission status: Accepted

Solution code:
s = list(input())
l = len(s)
a = ''
if l%2 != 0:
    for i in range(l//2+1):
        a = a + "".join(s[2*i])
else:
    for i in range(l//2):
        a = a + "".join(s[2*i])
print(a)

Submission status: Accepted

Solution code:
s = input()
list = [s[i] for i in range(0, len(s), 2)]
ans = "".join(list)
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 = []
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:
s=list(input())
answer_list=[]
for i in range(0,len(s),2):
  answer_list.append(s[i])

print("".join(answer_list))

Submission status: Accepted

Solution code:
s = str(input())

l = len(s)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
w = str(input())

print(w[0::2])

Submission status: Accepted

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

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:
letters = list(input())
new_letters = []

for i, ltr in enumerate(letters, 1):
  if i % 2 == 1:
    new_letters.append(ltr)

print(''.join(new_letters))

Submission status: Accepted

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

Submission status: Accepted

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

if '__main__' == __name__:
    resolve()

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())
print(s[0:len(s)+1:2])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1

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

if __name__ == '__main__':
    main()

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=str(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()
a=[]
for i in range(0,len(s),2):
    a.append(s[i])
print(''.join(a))

Submission status: Accepted

Solution code:
s = input() + " "
print("".join([s[q] for q in range(len(s)) if q % 2 == 0]).rsplit()[0])

Submission status: Accepted

Solution code:
from sys import stdin

s = stdin.readline().rstrip()

print(s[::2])

Submission status: Accepted

Solution code:
s = input()

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

print()

Submission status: Accepted

Solution code:
import math
S=str(input())
s = ""
for i in range(math.ceil(len(S)/2)):
  s = s + S[2*i]
print(s)

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()
print(''.join([s[i] for i in range(len(s)) if i%2==0]))

Submission status: Accepted

Solution code:
## coding: UTF-8
from decimal import *
from itertools import permutations, combinations,combinations_with_replacement,product
import math

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

print('{}'.format(''.join(l)))

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

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

print(s_odd)

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=list(input())
for i in range(len(s)):
    if i%2==0:
        print(s[i],end="")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import deque
s = input()
ans = deque([])
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.append(S[i])
ans=''.join(ans)
print(ans)

Submission status: Accepted

Solution code:
s = input()
ans = s[::2]
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()
print(S[0:len(S):2])

Submission status: Accepted

Solution code:
abc=list(input())
out=[]
for x in range(0,len(abc),2):
    out.append(abc[x])
print("".join(out))

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()
l = []
for i in range(len(s)):
  if i % 2 == 0:
    l.append(s[i])
a = ''.join(l)
print(a)

Submission status: Accepted

Solution code:
s = list(input())
l = []
for i,j in enumerate(s):
    if i%2==0:
        l.append(j)
print(''.join(l))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# solution
import io

data = input()

print(data[::2])

Submission status: Accepted

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

Submission status: Accepted

Solution code:

s = list(input())
t = []

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

print("".join(t))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
moji = str()
for i in range(1,len(s)+1,2):
    moji += s[i-1]
print(moji)

Submission status: Accepted

Solution code:
s=input()

t=""
t+=s[0::2]

print(t)

Submission status: Accepted

Solution code:
s = input()

ans = ''
for i, c in enumerate(s):
    if i % 2 == 0:
        ans += c

print(ans)

Submission status: Accepted

Solution code:
# ABC 072: B – OddString
s = input()
t = ''
for i in range(0, len(s), 2):
    t += s[i]
print(t)

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

a = len(s)
b =""

if a % 2 == 0:
    for i in range(0,a-1,2):
        b += s[i]
else:
    for i in range(0,a,2):
        b += s[i]

print(b)

Submission status: Accepted

Solution code:
s = input()
for i in range(len(s)):
    # s[0]から開始するため奇数番目の文字のインデックスは2で割り切れる
    if i%2 == 0:
        print(s[i], end = '')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import os
import math

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

MOD = 10 ** 9 + 7


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

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s =input()

N=len(s)
slist=[]

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

M=len(slist)
ans=''
for i in range(M):
  ans=ans+slist[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:
S = 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(0,l,2):
    ans.append(s[i])
    
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 = input()
ans = ""
for i in range(0, len(s), 2):
  ans = ans + s[i]
print(ans)

Submission status: Accepted

Solution code:
s = input()
x = len(s)
y = 0
while (x >= 1):
  print(s[y],end = "")
  y +=2
  x -=2

Submission status: Accepted

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

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:
import sys
import heapq, math
from itertools import zip_longest, permutations, combinations, combinations_with_replacement
from itertools import accumulate, dropwhile, takewhile, groupby
from functools import lru_cache
from copy import deepcopy
print(input()[::2])

Submission status: Accepted

Solution code:
s = input()

lis = [s[i] for i in range(len(s)) if i%2 == 0]
print("".join(lis))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
ans = []
for i, c in enumerate(list(input())):
    if i % 2 == 0:
        ans.append(c)

print(''.join(ans))

Submission status: Accepted

Solution code:
#import itertools
#import fractions
#import numpy as np
#mod = 10**4 + 7
"""def kiri(n,m):
  r_ = n / m
  if (r_ - (n // m)) > 0:
    return (n//m) + 1
  else:
    return (n//m)"""

# Written by NoKnowledgeGG @YlePhan

#import math
#mod = 10**9+7



def main():
  s = input()
  na = ""
  i = 0
  while i < len(s):
    na += s[i:i+1]
    i += 2
  print(na)
if __name__ == '__main__':
  main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8

s = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

import math
import itertools
import statistics
#import numpy as np
import collections

#n = int(input())
#h, w = list(map(int, input().split()))
s = input()
for i in range(len(s)):
    if i%2==0:
        print(s[i], end="")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
line = input()
answer = line[::2]
print(answer)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

if len(s) % 2 == 0:
    list = [""] * (len(s) // 2)
else:
    list = [""] * (len(s) // 2 + 1)

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

print("".join(list))

Submission status: Accepted

Solution code:
s = input()
ans = ''
count = 1
for v in s:
  if count % 2 != 0:
    ans += v
  count += 1
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())
list = [(i) for i in range(len(s)) if i % 2 == 0]
index = []
for i in list:
    index.append(s[i])
print("".join(index))

Submission status: Accepted

Solution code:
s=input()

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

Submission status: Accepted

Solution code:
s = list(input())
S = s[::2]
ans = "".join(S)
print(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 = input()
l = []

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

print(''.join(l))

Submission status: Accepted

Solution code:
import math

a=input()
print(a[0::2])

Submission status: Accepted

Solution code:
s = list(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = list(input())
print("".join(s[0:len(s):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()
for i in range(0,len(s),2):
  print(s[i], end = "")

Submission status: Accepted

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

Submission status: Accepted

Solution code:

s=input()

print(s[::2])

Submission status: Accepted

Solution code:
# Author: cr4zjh0bp
# Created: Sun Mar 22 22:02:37 UTC 2020
import sys
 
stdin = sys.stdin
inf = 1 << 60
mod = 1000000007
 
ni      = lambda: int(ns())
nin     = lambda y: [ni() for _ in range(y)]
na      = lambda: list(map(int, stdin.readline().split()))
nan     = lambda y: [na() for _ in range(y)]
nf      = lambda: float(ns())
nfn     = lambda y: [nf() for _ in range(y)]
nfa     = lambda: list(map(float, stdin.readline().split()))
nfan    = lambda y: [nfa() for _ in range(y)]
ns      = lambda: stdin.readline().rstrip()
nsn     = lambda y: [ns() for _ in range(y)]
ncl     = lambda y: [list(ns()) for _ in range(y)]
nas     = lambda: stdin.readline().split()

s = ns()
n = len(s)

for i in range(n):
    if (i + 1) % 2 == 1:
        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()
print(S[0::2])

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:
#!/usr/bin/env python3
import sys


def solve(s: str):
    print(s[::2])


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print("".join([c for i,c in enumerate(list(input())) if (i+1)%2]))

Submission status: Accepted

Solution code:
s = input().strip()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

s = input()

print("{}".format(s[0::2]))

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:
# B
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

print(*s[::2], sep="")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

list = list(s)
last = []

i = 0


while i < len(s):
    if i % 2 == 0:
        last.append(list[i])
        i += 1

    elif i % 2 == 1:
        i += 1

print(''.join(last))

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

print( ''.join( [s[i]for i in range(0, len(s),2)]))

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

output = [S[i] for i in range(len(S)) if i % 2 == 0]

print(''.join(output))

Submission status: Accepted

Solution code:
s = list(input())
a = []
for i in range(len(s)):
  if 2*i+1 <= len(s):
    a.append(s[2*i])
  else:
    break
print(''.join(a))

Submission status: Accepted

Solution code:
s = input()

ans =""

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

Submission status: Accepted

Solution code:
def resolve():

    s=str(input())

    print(s[::2])

resolve()

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=str(input())
c=''
for i in range(len(s)):
  if i%2==0:
    c+=s[i]

print(c)

Submission status: Accepted

Solution code:
S = input()
ans = ''
for i,s in enumerate(S):
  if i%2==0:
    ans += s
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
li=[str(i) for i in input()]
li=li[0::2]
print("".join(li))

Submission status: Accepted

Solution code:
#72B odd string
s=list(input())
num=1
ans=list()
for i in s:
    if num%2==1:
        ans.append(i)
        
    else:
        pass
    num+=1
print("".join(ans))

Submission status: Accepted

Solution code:
ss = input().strip()
i=0
for s in ss:
  if i%2==0:
    print(s,end="")
  i+=1

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = list(input())
ans = "".join([s[2 *i] for i in range(- (-len(s)//2))])
print(ans)

Submission status: Accepted

Solution code:
s = list(input())
ans_list = [s[2 *i] for i in range(- (-len(s)//2))]
    
ans = "".join(ans_list)
print(ans)

Submission status: Accepted

Solution code:
s = list(input())
ans_list = []
for v in range(- (-len(s)//2)):
    ans_list.append(s[2 * v])
    
ans = "".join(ans_list)
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
s = input()
t = ''
for i in range(len(s)):
    if i % 2 == 0:
        t += s[i]
print(t)

Submission status: Accepted

Solution code:
s = list(input())
ans = []
for i,t in enumerate(s):
    if i %2 == 0:
        ans.append(t)

print("".join(ans))

Submission status: Accepted

Solution code:
# Problem https://atcoder.jp/contests/abc072/tasks/abc072_b
# Python 3rd Try
import copy


class Problem:
    def __init__(self, inputstring):
        self.inputstring = inputstring

    def __str__(self):
        return self.inputstring

    def solver(self):
        result = ''
        string = copy.copy(self.inputstring)
        result = string[0:len(string):2]
        return result


if __name__ == "__main__":
    s = input()
    x = Problem(s)
    print(x.solver())

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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:
list1 = list(input())
index = 0
ans = []
for w in list1:
  if index % 2 == 0:
    ans.append(w)
  index += 1
print(*ans, sep="")

Submission status: Accepted

Solution code:
import math
s = list(input())
t=[]
for i in range(math.ceil(len(s)/2)):
    t.append(s[2*i])
print(''.join(t))

Submission status: Accepted

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

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

def main():
    mod=10**9+7
    s=input()
    ans=[]
    N=len(s)
    for i in range(0,N,2):
        ans.append(s[i])
    print(''.join(map(str, ans)))

main()

Submission status: Accepted

Solution code:
S = input()

result=''
for i, s  in enumerate(S):
  if i % 2 == 0:
    #print(i+1)
    result += s
    
print(result)

Submission status: Accepted

Solution code:
s = input().rstrip('\r')
new_s = ''
for i, c in enumerate(s):
    if (i+1) % 2 == 1:
        new_s += c
print(new_s)

Submission status: Accepted

Solution code:
#ABC072

print(input()[::2])

Submission status: Accepted

Solution code:
s=str(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(s[::2])