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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
s = input()
a = len(s)//2 + len(s) % 2
li = []
for i in range(a):
    li.append(s[i*2])
print("".join(li))

Submission status: Accepted

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

Submission status: Accepted

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

S = list(str(input()))

ans = []

for i in range(0, len(S), 2):
    ans.append(S[i])

print(*ans, sep='')

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


print(s[::2])

Submission status: Accepted

Solution code:
def resolve():
    s = input()
    ans = ""

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
INF = 10**9
mod = 10**9+7

S = s()
L = []
for i in range(0,len(S),2):
    L.append(S[i])
print(''.join(L))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
res = ""
for i, s_i in enumerate(s):
  if i % 2 == 0:
    res += s_i
print(res)

Submission status: Accepted

Solution code:
def main():
  s = input()
  flg=0
  for i in range(0,len(s)):
    if (i+1)%2==1:
      print(s[i],end="")
  print()
main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
s = input()
if not s.islower():
    sys.exit()
if len(s) < 0 or len(s) > 10 ** 5:
    sys.exit()

print(s[::2])

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

Submission status: Accepted

Solution code:
import math

def mi():
    return map(int, input().split())

def ii():
    return int(input())

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

if __name__ == '__main__':
    main()

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:
# Vicfred
# https://atcoder.jp/contests/abc072/tasks/abc072_b
# string manipulation, simulation
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()
a = ""
for i in range(len(s)):
  if i % 2 == 0:
    a += s[i]
print(a)

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

num = len(S)//2
ans = []

if len(S) % 2!=0:
    num += 1
    for i in range(num):
        nn = 2*i
        ans.append(S[nn])
else:
    for i in range(num):
        nn = 2*i
        ans.append(S[nn])
        
        
print("".join(ans))

Submission status: Accepted

Solution code:
s = input()

oddstring = s[0]
a = ((len(s) + 1) // 2) - 1

if a > 0:
    for i in range(a):
        oddstring += s[2*i+2]

print(oddstring)

Submission status: Accepted

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

print(result)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = list(input())
N = len(s)
ans = []
for i in range(N):
  if i % 2 == 0:
    ans.append(s[i])
ans = ''.join(ans)
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 k in range(0,len(s),2):
    ans += s[k]
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()
for i in range(len(s)):
    if i % 2 == 0:
        print(s[i], end='')
print()

Submission status: Accepted

Solution code:
import math
import string
import collections
from collections import Counter
from collections import deque
from decimal import Decimal
import sys
import fractions
from operator import itemgetter
import itertools


def readints():
    return list(map(int, input().split()))


def nCr(n, r):
    return math.factorial(n)//(math.factorial(n-r)*math.factorial(r))


def has_duplicates2(seq):
    seen = []
    for item in seq:
        if not(item in seen):
            seen.append(item)
    return len(seq) != len(seen)


def divisor(n):
    divisor = []
    for i in range(1, n+1):
        if n % i == 0:
            divisor.append(i)
    return divisor


# coordinates
dx = [-1, -1, -1, 0, 0, 1, 1, 1]
dy = [-1, 0, 1, -1, 1, -1, 0, 1]
s = input()
for i in range(len(s)):
    if i % 2 == 0:
        print(s[i], end='')

Submission status: Accepted

Solution code:
from statistics import median
import collections
#aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]
#from fractions import gcd
#from itertools import combinations # (string,3) 3回
#from collections import deque
#from collections import deque,defaultdict
#import bisect
#
#    d = m - k[i] - k[j]
#    if kk[bisect.bisect_right(kk,d) - 1] == d:
#
#
#
# pythonで無理なときは、pypyでやると正解するかも！！
#
#

import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7
#mod = 9982443453
def readInts():
  return list(map(int,input().split()))
def I():
  return int(input())
print(input()[0::2])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
string = input()

new = [string[i] for i in range(len(string)) if i % 2 == 0]

print(''.join(new))

Submission status: Accepted

Solution code:
s = list(input())

ans=[]
for i in s[::2]:
    ans.append(i)
Str = "".join(ans)
print(Str)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
ans = []
s = list(s)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#OddString
s = str(input())

x = s[::2]

print(x)

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == '__main__':
  main()

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()
a=""
n=len(s)
for i in range(n//2):
  a+=s[i*2]
if n%2:
  a+=s[n-1]
print(a)

Submission status: Accepted

Solution code:
import sys
## io ##
def IS(): return sys.stdin.readline().rstrip()
def II(): return int(IS())
def MII(): return list(map(int, IS().split()))
#======================================================#

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s = input()
ans = ''
for i in range(len(s)):
  if (i + 1) % 2 == 1:
    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=list(input())
t=""
for i in range(len(s)):
  if i%2==0: #0indexなので偶数に
    t+=s[i]
print(t)

Submission status: Accepted

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

Solution code:
s = input()

print("".join([c for idx, c in enumerate(s) if idx % 2 == 0]))

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:

if __name__ == '__main__':
    a = input()
    s =""

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

Submission status: Accepted

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

Submission status: Accepted

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

for i in range(1, len(s)+1):
    if i%2 != 0:
        ans.append(s[i-1])

print("".join(ans))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s= input()

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

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

Submission status: Accepted

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

import sys
# import time
# import math
# import numpy as np
# import scipy.sparse.csgraph as cs            # csgraph_from_dense(ndarray, null_value=inf), bellman_ford(G, return_predecessors=True), dijkstra, floyd_warshall
# import random                                # random, uniform, randint, randrange, shuffle, sample
# import string                                # ascii_lowercase, ascii_uppercase, ascii_letters, digits, hexdigits
# import re                                    # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from collections import deque                # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict          # subclass of dict. defaultdict(facroty)
# from collections import Counter              # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from datetime import date, datetime          # date.today(), date(year,month,day) => date obj; datetime.now(), datetime(year,month,day,hour,second,microsecond) => datetime obj; subtraction => timedelta obj
# from datetime.datetime import strptime       # strptime('2019/01/01 10:05:20', '%Y/%m/%d/ %H:%M:%S') returns datetime obj
# from datetime import timedelta               # td.days, td.seconds, td.microseconds, td.total_seconds(). abs function is also available.
# from copy import copy, deepcopy              # use deepcopy to copy multi-dimentional matrix without reference
# from functools import reduce                 # reduce(f, iter[, init])
# from functools import lru_cache              # @lrucache ...arguments of functions should be able to be keys of dict (e.g. list is not allowed)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import nlargest, nsmallest        # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
# from itertools import count, cycle, repeat   # count(start[,step]), cycle(iter), repeat(elm[,n])
# from itertools import groupby                # [(k, list(g)) for k, g in groupby('000112')] returns [('0',['0','0','0']), ('1',['1','1']), ('2',['2'])]
# from itertools import starmap                # starmap(pow, [[2,5], [3,2]]) returns [32, 9]
# from itertools import product, permutations  # product(iter, repeat=n), permutations(iter[,r])
# from itertools import combinations, combinations_with_replacement
# from itertools import accumulate             # accumulate(iter[, f])
# from operator import itemgetter              # itemgetter(1), itemgetter('key')
# from fractions import gcd                    # for Python 3.4 (previous contest @AtCoder)



def main():
    mod = 1000000007                # 10^9+7
    inf = float('inf')              # sys.float_info.max = 1.79...e+308
    # inf = 2 ** 64 - 1             # (for fast JIT compile in PyPy) 1.84...e+19
    sys.setrecursionlimit(10**6)    # 1000 -> 1000000
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    
    s = input()
    n = len(s)
    print(''.join([s[i] for i in range(0, n, 2)]))


if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

print(m)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#OddString
s = input()

print(s[0::2])

Submission status: Accepted

Solution code:
s = input()

N = len(s)

c =""
for i in range(0,N,2):
    b = s[i]
    c = c + b

print(c)

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:
# -*- coding: utf-8 -*-
print(input()[::2])

Submission status: Accepted

Solution code:

s = input()

if len(s) != 1:
    ans = [0] *(round(len(s)/2))
else:
    ans = [0]

ind = 0
for i in range(len(s)):

    if (i+1) % 2 == 1:
        ans[ind] =str( s[i])
        ind += 1

ans = ''.join(ans)
print(str(ans))

Submission status: Accepted

Solution code:
s = input()

ans = ""
for i in range(len(s)):
    if i % 2 == 1: continue
    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:
import sys
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7

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

if __name__ == '__main__':
    main()

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**6)
INF = float('inf')
MOD = 10 ** 9 + 7
def rs(): return sys.stdin.readline().rstrip()
def ri(): return int(rs())
def rf(): return float(rs())
def rs_(): return [_ for _ in rs().split()]
def ri_(): return [int(_) for _ in rs().split()]
def rf_(): return [float(_) for _ in rs().split()]
def divisors(n, sortedresult=True):
    div = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            div.append(i)
            if i != n // i:
                div.append(n//i)
    if sortedresult:
        div.sort()
    return div
# endregion
print(rs()[::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()
ans=""
for i in range(len(s)):
    if i%2==0:
        ans+=s[i]
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()
ans=""
ans+=s[0::2]
print(ans)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
import bisect
import numpy as np

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

Submission status: Accepted

Solution code:
str1=input()
#print(str1[0])

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

print(ans)

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

word = [x for x in input]
word = word[::2]

output = ""
for i in word:
  output += i
  
print(output)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math
import bisect

def solve(s):
    n = len(s)
    A = []
    for i in range(0, n, 2):
        A.append(s[i])
    return ''.join(A)

def main():
    print(solve(input()))

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()

def resolve():
    
    s=str(input())
    print(s[::2])
    
resolve()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# ABC072 B

def main():
    s = input()

    print(s[::2])

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import math
import string
import collections
from collections import Counter


def readints():
    return list(map(int, input().split()))


def nCr(n, r):
    return math.factorial(n)//(math.factorial(n-r)*math.factorial(r))


def has_duplicates2(seq):
    seen = []
    for item in seq:
        if not(item in seen):
            seen.append(item)
    return len(seq) != len(seen)


def divisor(n):
    divisor = []
    for i in range(1, n+1):
        if n % i == 0:
            divisor.append(i)
    return divisor


# coordinates
dx = [-1, -1, -1, 0, 0, 1, 1, 1]
dy = [-1, 0, 1, -1, 1, -1, 0, 1]

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

Submission status: Accepted

Solution code:
S = list(input())
res = []
for i in range(len(S)):
    if (i+1)%2:
        res.append(S[i])
print(''.join(res))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
string = input()
r = []
for index, s in enumerate(string):
	if (index + 1 ) % 2 != 0:
  		r.append(s)
print(''.join(r))

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

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


def main():
    s = input().rstrip()

    ans = s[::2]

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

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


def readstr():
    return input().strip()


def readint():
    return int(input())


def readnums():
    return map(int, input().split())


def readstrs():
    return input().split()


def main():
    s = readstr()
    l = []
    for i, x in enumerate(s):
        if not i % 2:
            l.append(x)

    print(''.join(l))


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def solve():
    S = input()
    ans = S[0::2]
    
    return ans
print(solve())

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:
def main():
    s = list(input())
    n = len(s)
    ans = ''
    for i in range(n):
        if i % 2 == 0:
            ans += s[i]
    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

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


if __name__ == '__main__':
    main()

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 (0, len(S)):
	if i%2==0:
		P.append(S[i])

cosmos = P[0]

for i in range (1, len(P)):
	cosmos+=P[i]

print(cosmos)

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

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

Submission status: Accepted

Solution code:
s=input()
a=[]
  
def convert(s): 
  
    # initialization of string to "" 
    new = "" 
  
    # traverse in the string  
    for x in s: 
        new += x  
  
    # return string  
    return new 
for i in range(len(s)):
  if i%2==0:
    a.append(s[i])
print(convert(a))

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s = input()

ans = []
for i, v in enumerate(s):
  if i%2==0:
    ans.append(v)
print("".join(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 = input()
ans = []
for i,si in enumerate(s):
  if i%2 == 0:
    ans.append(si)
print(''.join(ans))

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

if __name__ == "__main__":
  resolve()

Submission status: Accepted

Solution code:
S=input()
N=len(S)
ans=""

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

Submission status: Accepted

Solution code:
s = str(input())

t = ''

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7


def resolve():
    s = input()
    res = ""
    for i in range(0, len(s), 2):
        res += s[i]
    print(res)


if __name__ == '__main__':
    resolve()

Submission status: Accepted

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

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys
# input = sys.stdin.readline
sys.setrecursionlimit(10 ** 9)
MOD = 10 ** 9 + 7

S = list(input())

print (*S[::2], sep = '')

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
s = input()

w = ''
n = len(s)
for a in range(0, n):
    if a % 2 == 0:
        w += s[a]

print(w)

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:
import sys
import math
s = input()
ans=''
if (len(s) % 2 == 0):
    for i in range(0, len(s), 2):
        ans+=s[i]
else:
    for i in range(0, len(s)+1, 2):
        ans += s[i]
print(ans)