input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
n = int(eval(input()))
a = list(map(int,input().split()))
ans = []
if n % 2 == 0:
for i in range(n-1,0,-2):
ans = ans + [a[i]]
for i in range(0,n,2):
ans = ans + [a[i]]
else:
for i in range(n-1,-1,-2):
ans = ans + [a[i]]
for i in range(1,n,2):
ans = ans + [a[i... | n = int(eval(input()))
a = list(map(int,input().split()))
ans = []
if n % 2 == 0:
for i in range(n-1,0,-2):
ans.append(a[i])
for i in range(0,n,2):
ans.append(a[i])
else:
for i in range(n-1,-1,-2):
ans.append(a[i])
for i in range(1,n,2):
ans.append(a[i])
prin... | p03673 |
N = int(eval(input()))
char = input().split()
out = []
for x in range(0,N):
out.append(char[x])
out.reverse()
print((" ".join(out))) | n = int(eval(input()))
s = input().split()
s1 = s[::2]
s2 = s[1::2]
if s2:
if len(s) % 2:
print((" ".join(s1[::-1]) +" "+ " ".join(s2)))
else:
print((" ".join(s2[::-1]) +" "+ " ".join(s1)))
else:
print((" ".join(s1))) | p03673 |
n = int(eval(input()))
a = input().split()
b = []
for i in a:
b.append(i)
b.reverse()
print((" ".join(b)))
| n = 4
a = [1, 2, 3, 4]
n = int(eval(input()))
a = input().split()
if n % 2 == 0:
y = [a[j] for j in range(1, n, 2)][::-1]
z = [a[j] for j in range(0, n, 2)]
else:
y = [a[j] for j in range(0, n, 2)][::-1]
z = [a[j] for j in range(1, n, 2)]
print((" ".join(map(str, y + z))))
| p03673 |
n =int(eval(input()))
ls = []
if n%2==0:
for i,j in enumerate(input().split()):
if i%2==0:
ls.append(j)
else:
ls.insert(0,j)
else:
for i,j in enumerate(input().split()):
if i%2==1:
ls.append(j)
else:
ls.insert(0,j)
... | n =int(eval(input()))
a = list(map(str,input().split()))
lss = []
lse = []
if n%2==0:
for i in range(n//2):
lss.append(a[2*i])
for i in range(n//2):
lse.append(a[n-(2*i+1)])
else:
for i in range(n//2):
lss.append(a[2*i+1])
for i in range(n//2+1):
lse.append... | p03673 |
n = int(eval(input()))
a = list(map(int,input().split()))
b = []
for i in range(n):
if i % 2 == 1:
b = b + [a[i]]
else:
b = [a[i]] + b
if n % 2 == 0:
b.reverse()
print((' '.join(map(str,b)))) | n = int(eval(input()))
a = list(map(int,input().split()))
b = []
c = []
for i in range(n):
if i % 2 == 1:
b.append(a[i])
else:
c.append(a[i])
if n % 2 == 0:
b.reverse()
ans = b + c
else:
c.reverse()
ans = c + b
print((' '.join(map(str,ans)))) | p03673 |
n = int(eval(input()))
a = list(map(int, input().split()))
b = []
for i in a:
b.append(str(i))
b = b[::-1]
print((' '.join(b))) | n = int(eval(input()))
a = list(map(str, input().split()))
b = a[::-2] + a[len(a)%2::2]
print((' '.join(b))) | p03673 |
n = int(eval(input()))
a = list(map(str, input().split()))
b = a[::-2] + a[len(a)%2::2]
print((' '.join(b))) | n = int(eval(input()))
a = input().split()
print((' '.join(a[::-2] + a[n%2::2]))) | p03673 |
# https://qiita.com/_-_-_-_-_/items/34f933adc7be875e61d0
# abcde s=input() s='abcde'
# abcde s=list(input()) s=['a', 'b', 'c', 'd', 'e']
# 5(1つだけ) a=int(input()) a=5
# 1 2 | x,y = map(int,input().split())| x=1,y=2
# 1 2 3 4 5 ... n li = input().split() li=['1','2','3',...,'n']
# 1 2 3 4 5 ... n li = list(map(... | # https://qiita.com/_-_-_-_-_/items/34f933adc7be875e61d0
# abcde s=input() s='abcde'
# abcde s=list(input()) s=['a', 'b', 'c', 'd', 'e']
# 5(1つだけ) a=int(input()) a=5
# 1 2 | x,y = map(int,input().split())| x=1,y=2
# 1 2 3 4 5 ... n li = input().split() li=['1','2','3',...,'n']
# 1 2 3 4 5 ... n li = list(map(... | p03673 |
from collections import deque
n = int(input())
A = list( map( int, input().split()))
B = deque()
reverse = 0
for i in range(n):
if reverse == 0:
B.append(A[i])
reverse = 1
else:
B.appendleft(A[i])
reverse = 0
B = list(B)
if reverse == 1:
B = B[::-1]
for i in ra... | from collections import deque
n = int(eval(input()))
A = list( map( int, input().split()))
B = deque()
reverse = 0
for i in range(n):
if reverse == 0:
B.append(A[i])
reverse = 1
else:
B.appendleft(A[i])
reverse = 0
B = list(B)
if reverse == 1:
B = B[::-1]
print... | p03673 |
n=int(input())
l=list(map(int,input().split()))
ans=[]
for i in range(n):
ans.append(l[i])
ans.reverse()
for i in range(n-1):
print(ans[i],end=" ")
print(ans[n-1])
| n=int(input())
l=list(map(int,input().split()))
ans=[-1]*n
l.reverse()
for i in range(n):
if i%2==0:
ans[i//2]=l[i]
else:
ans[n-1-((i-1)//2)]=l[i]
for i in range(n-1):
print(ans[i],end=" ")
print(ans[n-1])
| p03673 |
n = int(eval(input()))
a = list(map(int,input().split()))
ans = []
for i in a:
ans.append(i)
ans = ans[::-1]
let = ""
for j in ans:
let += str(j) + " "
print((let[:-1])) | n = int(eval(input()))
a = list(input().split())
ans = ' '.join(a[::-2])
if n % 2 == 0:
ans += " " + ' '.join(a[::2])
else:
ans += " " + ' '.join(a[1::2])
print(ans) | p03673 |
from collections import deque
n = int(eval(input()))
a = list(map(int, input().split()))
b = deque()
ok = True
for i in range(n):
if ok:
b.append(a[i])
ok = False
else:
b.appendleft(a[i])
ok = True
b = list(map(str, list(b)))
if ok:
print((" ".join(b)))
else:
print((" ".join(... | from collections import deque
n = int(eval(input()))
a = list(input().split())
ans = deque()
for i in range(n):
if i%2==0: ans.append(a[i])
else: ans.appendleft(a[i])
ans = list(ans)
if n%2==0:
print((" ".join(ans)))
else:
print((" ".join(ans[::-1])))
| p03673 |
N=int(eval(input()))
b=[]
k=N%2
for a in list(map(int,input().split())):
if k==a%2:
b.insert(0,a)
else:
b.append(a)
print((' '.join(map(str,b)))) | N=int(eval(input()))
A=list(map(int,input().split()))
print((' '.join(map(str,A[::-2]+A[N%2::2])))) | p03673 |
n = int(input())
a = list(map(int, input().split()))
b = []
for i in range(n):
if i % 2 == 0:
b.append(a[i])
else:
b.insert(0,a[i])
if n % 2 == 1:
b = b[::-1]
if len(b) == 1:
print(b[0])
else:
for i in range(len(b)-1):
print(b[i], end=" ")
print(b[i+1... | n = int(input())
a = list(map(int, input().split()))
b = [0]*n
for i in range(n):
if i % 2 == 0:
b[n//2+i//2] = a[i]
else:
b[n//2-i//2-1] = a[i]
if n % 2 == 1:
b = b[::-1]
if len(b) == 1:
print(b[0])
else:
for i in range(len(b)-1):
print(b[i], end=... | p03673 |
import sys
import math
import collections
import itertools
import array
import inspect
# Set max recursion limit
sys.setrecursionlimit(1000000)
# Debug output
def chkprint(*args):
names = {
id(v): k
for k, v in list(inspect.currentframe().f_back.f_locals.items())
}
print(... | import sys
import math
import collections
import itertools
import array
import inspect
# Set max recursion limit
sys.setrecursionlimit(1000000)
# Debug output
def chkprint(*args):
names = {
id(v): k
for k, v in list(inspect.currentframe().f_back.f_locals.items())
}
print(... | p03673 |
n = int(eval(input()))
a = list(map(int, input().split()))
b = []
front = False
for i in a:
if front:
b.insert(0, i)
front = False
else:
b.append(i)
front = True
if front:
b.reverse()
b = list(map(str, b))
b = " ".join(b)
print(b) | n = int(input())
a = list(map(int, input().split()))
'''
b = []
front = False
for i in a:
if front:
b.insert(0, i)
front = False
else:
b.append(i)
front = True
if front:
b.reverse()
b = list(map(str, b))
b = " ".join(b)
print(b)
'''
first =... | p03673 |
n = int(input())
a = [x for x in input().split()]
b = []
for i in range(n):
b.append(a[i])
b.reverse()
print(*b, sep=' ')
| n = int(input())
a = [x for x in input().split()]
b = []
if n % 2 == 1:
for i in reversed(range(1, n+1, 2)):
b.append(a[i-1])
for i in range(2, n, 2):
b.append(a[i-1])
else:
for i in reversed(range(2, n+1, 2)):
b.append(a[i-1])
for i in range(1, n, 2):
b.app... | p03673 |
from collections import deque
n = int(eval(input()))
A = list(map(int, input().split()))
B = deque()
for i in range(n):
B.append(A[i])
B.reverse()
text = ""
for b in B:
text += str(b) + " "
text = text[:-1]
print(text) | from collections import deque
n = int(eval(input()))
A = list(map(int, input().split()))
B = deque()
for i in range(n):
if(i%2 == 0):
B.append(A[i])
if(i%2 == 1):
B.appendleft(A[i])
if(n%2 == 1):
B.reverse()
text = ""
for b in B:
text += str(b) + " "
text = text[:-1]
p... | p03673 |
n = int(eval(input()))
a = [int(i) for i in input().split()]
b = []
count = 0
for i in a:
if count % 2 == 0:
b.append(i)
else:
b.insert(0, i)
count += 1
if n % 2 == 0:
print((' '.join([str(i) for i in b])))
else:
b.reverse()
print((' '.join([str(i) for i in b])))
| n=int(eval(input()))
a=list(input().split())
b=[]
if len(a)%2==0:
for i in range(n-1,0,-2):
b.append(a[i])
for i in range(0,n-1,2):
b.append(a[i])
else:
for i in range(n-1,-1,-2):
b.append(a[i])
for i in range(1,n-1,2):
b.append(a[i])
print((' '.join(b)))
| p03673 |
n = int(eval(input()))
a = [int(x) for x in input().split()]
b = []
ap = b.append
for i in range(n):
ap(a[i])
b.reverse()
print((' '.join(map(str, b)))) | n = int(eval(input()))
a = input().split()
if n & 1:
print((' '.join(a[::-2]+a[1::2])))
else:
print((' '.join(a[-1:0:-2]+a[::2]))) | p03673 |
n=int(eval(input()))
a=list(map(int,input().split()))
b=[]
for i in range(n):
if i%2==0:
b.append(a[i])
else:
b.insert(0,a[i])
if n%2==0:
print((' '.join(map(str, b))))
else:
print((' '.join(map(str, list(reversed(b)))))) | n=int(eval(input()))
a=list(map(int,input().split()))
b0=[]
b1=[]
for i in range(n):
if i%2==0:
b0.append(a[i])
else:
b1.append(a[i])
if n%2!=0:
b0=list(reversed(b0))
b=b0+b1
print((' '.join(map(str, b))))
else:
b1=list(reversed(b1))
b=b1+b0
print((' '.join(map(str, b))))
| p03673 |
def main():
n = int(eval(input()))
A = input().split()
ans = []
if n % 2 == 0:
for i in range(0, n - 1, 2):
ans.append(A[i])
ans = [A[i + 1]] + ans
else:
for i in range(0, n - 1, 2):
ans.append(A[i + 1])
ans = [A[i]] + ans
... | def main():
n = int(eval(input()))
A = input().split()
B = [0] * n
k = n % 2
l = n // 2
if k == 0:
l -= 1
r = l + 1
for i in range(n):
if i % 2 != k:
B[l] = A[i]
l -= 1
else:
B[r] = A[i]
r += 1
pr... | p03673 |
def main():
n = int(eval(input()))
A = input().split()
B = [0] * n
k = n % 2
l = n // 2
if k == 0:
l -= 1
r = l + 1
for i in range(n):
if i % 2 != k:
B[l] = A[i]
l -= 1
else:
B[r] = A[i]
r += 1
pr... | def main():
n = int(eval(input()))
A = input().split()
if n % 2 == 0:
print((' '.join(A[1::2][::-1] + A[0::2])))
else:
print((' '.join(A[0::2][::-1] + A[1::2])))
main()
| p03673 |
N = int(eval(input()))
a = list(input().split())
b = []
for i in range(N):
if i % 2 == 0:
b.append(a[i])
else:
b.insert(0, a[i])
if N % 2 == 1:
b = b[::-1]
print((" ".join(b))) | N = int(eval(input()))
a = list(input().split())
print((" ".join(a[-1::-2] + a[N%2::2]))) | p03673 |
n = int(eval(input()))
a = list(map(int, input().split()))
b = []
for i in range(n):
b.append(a.pop(0))
b = b[::-1]
print((' '.join(map(str, b)))) | n = int(eval(input()))
a = list(map(int, input().split()))
a_even = [elm_a for i, elm_a in enumerate(a) if i % 2 == 0]
a_odd = [elm_a for i, elm_a in enumerate(a) if i % 2 == 1]
ans = a_even[::-1] + a_odd
if n % 2 == 0:
ans = ans[::-1]
print((' '.join(map(str, ans)))) | p03673 |
if(__name__ =="__main__"):
N = int(eval(input()))
a =[int(i) for i in input().split()]
b = []
for i in range(N):
b.append(a[i])
#print(b)
b = b[::-1]
#print(b)
print((' '.join(map(str,b)))) | if(__name__ =="__main__"):
N = int(eval(input()))
a =[int(i) for i in input().split()]
b = []
for i in range(N-1,-1,-2):
b.append(a.pop(i))
#print(b)
# b = b[::-1] TLE:O(N)
#print(b)
b.extend(a)
print((' '.join(map(str,b)))) | p03673 |
n = int(eval(input()))
num_list = [ v for v in input().split() ]
b_list = []
for i in num_list:
b_list.append(i)
b_list.reverse()
print((" ".join(b_list))) | n = int(eval(input()))
num_list = [ v for v in input().split() ]
if n % 2 == 0:
print((" ".join(num_list[::-2]+num_list[::2])))
else:
print((" ".join(num_list[::-2]+num_list[1::2]))) | p03673 |
n = int(eval(input()))
a = list(map(int,input().split()))
b =[]
for i in range(1,n+1):
if (n%2)==(i%2):
b.insert(0,a[i-1])
else:
b.append(a[i-1])
print((' '.join(map(str,b)))) | n = int(eval(input()))
a = list(map(int,input().split()))
o =a[::2]
e =a[1::2]
if len(a)%2==0:
ans = e[::-1]+o
elif len(a)==1:
ans = a
else:
ans = o[::-1]+e
print((' '.join(map(str,ans)))) | p03673 |
from collections import deque
def resolve():
n = int(eval(input()))
a = list(map(int, input().split()))
b = [0]*n
d = deque()
h = len(b) // 2
for i in range(1, n+1):
if n % 2 == i % 2:
d.appendleft(str(a[i-1]))
else:
d.append(str(a[i-1]))
print((" ".join(d)))
resolve() | from collections import deque
def resolve():
n = int(eval(input()))
a = list(map(int, input().split()))
d = deque()
is_even = True if n % 2 == 0 else False
for i in range(n):
if is_even:
if (i+1) % 2 == 0:
d.appendleft(a[i])
else:
d.append(a[i])
else:
if (i+1) % 2 == 0:
d... | p03673 |
from collections import deque
def solve(a):
ans = deque()
for i, aa in enumerate(a):
ans.append(str(aa))
ans.reverse()
return list(ans)
if __name__ == "__main__":
n = int(eval(input()))
a = list(map(int, input().split()))
print((' '.join(solve(a))))
| from collections import deque
def solve(a):
ans = deque()
for i, aa in enumerate(a):
if i % 2 == 0:
ans.append(str(aa))
else:
ans.appendleft(str(aa))
if len(a) % 2 == 1:
ans.reverse()
return list(ans)
if __name__ == "__main__":
... | p03673 |
n = int(eval(input()))
a_list = list(map(int, input().split()))
b_list = []
for i, a in enumerate(a_list):
if i % 2 == 0:
b_list.insert(0, a)
else:
b_list.append(a)
if n % 2 ==0:
b_list.reverse()
print((" ".join(map(str, b_list))))
| n = int(eval(input()))
a_list = list(map(int, input().split()))
b_list_even = []
b_list_odd = []
for i, a in enumerate(a_list , start=1):
if i % 2 == 0:
b_list_even.append(a)
else:
b_list_odd.append(a)
if n % 2 != 0:
b_list_odd.reverse()
b_list = b_list_odd + b_list_even... | p03673 |
n = int(eval(input()))
a = list(map(int, input().split()))
b = []
for i in range(n):
if i % 2 == n % 2:
b.append(a[i])
else:
b.insert(0, a[i])
print((' '.join(map(str, b)))) | n = int(eval(input()))
a = list(map(int, input().split()))
b1 = []
b2 = []
for i in range(n):
if i % 2 == 0:
b1.append(a[i])
else:
b2.append(a[i])
if n % 2 == 0:
b2.reverse()
b = b2 + b1
else:
b1.reverse()
b = b1 + b2
print((' '.join(map(str, b))))
| p03673 |
from collections import deque
n, l, b = eval(input()), input().split(), deque()
for t in range(n):
b.append(l[t])
b.reverse()
print(' '.join(b)) | from collections import deque
n, l, b = eval(input()), input().split(), deque()
for t in range(n):
if (t + 1) % 2:
b.append(l[t])
else:
b.appendleft(l[t])
print(' '.join(reversed(b)) if n % 2 else ' '.join(b)) | p03673 |
from collections import deque
n, l, b = eval(input()), input().split(), deque()
for t in range(n):
b.append(l[t]) if (t + 1) % 2 else b.appendleft(l[t])
print(' '.join(reversed(b)) if n % 2 else ' '.join(b)) | n, l = eval(input()), input().split()
print(' '.join(l[0::2][::-1] + l[1::2]) if len(l) % 2 else ' '.join(l[1::2][::-1] + l[0::2])) | p03673 |
n = int(eval(input()))
a = input().split()
b = []
if n % 2:
for i in range(n):
if i % 2 == 0:
b.insert(0, a[i])
else:
b.append(a[i])
else:
for i in range(n):
if i % 2:
b.insert(0, a[i])
else:
b.append(a[i])
print(('... | n = int(eval(input()))
a = input().split()
even = a[::2]
odd =a [1::2]
if n % 2:
even = even[::-1]
b = even + odd
else:
odd = odd[::-1]
b = odd + even
print((' '.join(b)))
| p03673 |
n = int(input())
s = []
X = list(map(int, input().split()))
for i in range(n):
a = X[i]
s.append(a)
s.reverse()
for i in s:
print(i, end = '')
if(i!= n - 1):
print(' ', end='')
print()
| n = int(eval(input()))
s = ''
X = list(map(int, input().split()))
if(len(X) % 2 == 0):
for i in range(0, n, 2):
s += str(X[n - 1 - i])
s += ' '
for i in range(0, n, 2):
s += str(X[i])
s += ' '
else:
for i in range(0, n, 2):
s += str(X[n - i - 1])
... | p03673 |
import sys
n = int(eval(input()))
a = list(map(int, sys.stdin.readline().split()))
ans = []
for i in range(n):
if i % 2 == 0:
ans.insert(0, a[i])
else:
ans.append(a[i])
if len(a) % 2 == 0:
ans.reverse()
print((' '.join(map(str,ans))))
| import sys
n = int(eval(input()))
a = list(map(int, sys.stdin.readline().split()))
odd = a[1::2]
even = a[0::2]
odd.reverse()
ans = odd+even
if(len(a) % 2 != 0):
ans.reverse()
print((' '.join(map(str, ans))))
| p03673 |
n = int(eval(input()))
A = input().split()
b = []
for i,a in enumerate(A):
if i%2==0:
b.insert(0,a)
else:
b.append(a)
print((' '.join(reversed(b)) if n%2==0 else ' '.join(b))) | n = int(input())
A = input().split()
if n%2==0:
print(' '.join(A[1::2][::-1]),end=' ')
print(' '.join(A[::2]))
else:
print(' '.join(A[::2][::-1]),end=' ')
print(' '.join(A[1::2]))
| p03673 |
n=int(eval(input()))
a=list(input().split())
b=[]
if n%2==0:
for i in range(n):
if i==0:
b.append(a[i])
elif i%2==0:
b.append(a[i])
else:
b.insert(0,a[i])
else:
for i in range(n):
if i==0:
b.append(a[i])
elif ... | n=int(eval(input()))
a=list(input().split())
b=a[::-2]+a[len(a)%2::2]
print((' '.join(b)))
| p03673 |
from collections import deque
N=int(eval(input()))
A=tuple(map(str,input().split()))
B=deque()
for i in range(N):
B.append(A[i])
B.reverse()
ans=' '.join(list(B))
print(ans) | N=int(input())
A=list(map(int,input().split()))
print(*A[::-2],end=' ')
print(*A[N%2::2])
| p03673 |
n = int(eval(input()))
a = list(map(str, input().split()))
if n % 2 == 0:
ki = a[::2]
gu = a[1::2]
gu = gu[::-1]
ans = gu+ki
else:
ki = a[::2]
ki = ki[::-1]
gu = a[1::2]
ans = ki+gu
print((' '.join(ans))) | n = int(eval(input()))
a = list(input().split())
if n % 2 == 0:
ans = a[::-2]+a[::2]
else:
ans = a[::-2]+a[1::2]
print((' '.join(ans))) | p03673 |
n = int(eval(input()))
a = [int(i) for i in input().split()]
if n % 2 == 0:
a1 = a[::2]
a2 = a[1::2]
a2 = a2[::-1]
ans = a2 + a1
else:
a1 = a[::2]
a1 = a1[::-1]
a2 = a[1::2]
ans = a1 + a2
ans = list(map(str, ans))
print((' '.join(ans))) | n = int(eval(input()))
a = [int(i) for i in input().split()]
if n % 2 == 0:
lis1 = a[::2]
lis2 = a[::-2]
ans = lis2 + lis1
else:
lis1 = a[::-2]
lis2 = a[1::2]
ans = lis1 + lis2
ans = list(map(str, ans))
print((' '.join(ans))) | p03673 |
n = int(eval(input()))
A = list(map(int, input().split()))
B = []
for i in A:
B.append(str(i))
B = list(reversed(B))
print((" ".join(B))) | n = int(eval(input()))
A = list(map(int, input().split()))
B = []
C = []
for i in range(n):
if i % 2 == 0:
B.append(str(A[i]))
else:
C.append(str(A[i]))
if n % 2 == 0:
s = " ".join(list(reversed(C)))
t = " ".join(B)
print((s + " " + t))
else:
s = " ".join(li... | p03673 |
n = int(eval(input()))
a = list(input().split())
b = []
if n%2==1:
for i in a:
if int(i)%2==1: b.insert(0,i)
else: b.append(i)
else:
for i in a:
if int(i)%2==0: b.insert(0,i)
else: b.append(i)
print((" ".join(b))) | n = int(eval(input()))
a = list(input().split())
b = []
if n%2==1:
b = a[::-2]+a[1::2]
else:
b = a[::-2]+a[::2]
print((" ".join(b))) | p03673 |
n = int(eval(input()))
l = list(map(int,input().split()))
if n == 1:
l = list(map(str,l))
print((" ".join(l)))
exit()
2
ans = []
if n%2 == 0:
tmp = n
for j in range(n//2-1):
ans.append(tmp)
tmp -= 2
ans.append(tmp)
ans.append(1)
tmp = 1
for j in ... | n = int(eval(input()))
l = list(map(int,input().split()))
if n == 1:
l = list(map(str,l))
print((" ".join(l)))
exit()
ans = []
if n%2 == 0:
tmp = n
for j in range(n//2-1):
ans.append(tmp)
tmp -= 2
ans.append(tmp)
ans.append(1)
tmp = 1
for j in ran... | p03673 |
import sys
read_=sys.stdin.buffer.readline
N=int(read_())
A=input().split()
B=[A[0]]
cnt=0
for a in A[1:]:
if cnt%2==0:
B.insert(0,a)
cnt+=1
continue
B.append(a)
cnt+=1
if N%2==0:
print((' '.join(B)))
else:
print((' '.join(reversed(B)))) | import sys
read_=sys.stdin.buffer.readline
N=int(read_())
A=input().split()
if len(A)==1:
print((A[0]))
exit()
B1=A[::2]
B2=A[1::2]
if N%2==0:
B2.reverse()
B2.extend(B1)
print((' '.join(B2)))
else:
B1.reverse()
B1.extend(B2)
print((' '.join(B1))) | p03673 |
n = int(eval(input()))
a = [int(e) for e in input().split()]
ans = []
if n % 2 == 0:
for e in a[n-1::-2]:
ans.append(str(e))
for e in a[0::2]:
ans.append(str(e))
else:
for e in a[n-1::-2]:
ans.append(str(e))
for e in a[1::2]:
ans.append(str(e))
print((' '.j... | n = int(eval(input()))
a = [e for e in input().split()]
print((' '.join(a[n-1::-2] + a[n%2::2]))) | p03673 |
def solve():
N = int(eval(input()))
A = input().split()
b = []
for i,a in enumerate(A):
if i%2 == 0:
b.append(a)
else:
b.insert(0, a)
if N % 2 == 1:
b.reverse()
print((' '.join(b)))
solve() | def solve():
N = int(eval(input()))
A = list(map(int, input().split()))
b = []
left = []
right = []
for i,a in enumerate(A):
if i%2 == 0:
right.append(a)
else:
left.append(a)
# b.insert(0, a)
if N % 2 == 1:
right.reve... | p03673 |
n=int(eval(input()))
a=list(map(int,input().split()))
b1=[str(a[2*i]) for i in range(0,n//2)]
b2=[str(a[2*i+1]) for i in range(0,n//2)]
if n%2: b=[str(a[-1])]+list(reversed(b1))+b2
else: b=list(reversed(b2))+b1
print((" ".join(b))) | n=int(eval(input()))
a=input().split()
b1=[a[2*i] for i in range(0,n//2)]
b2=[a[2*i+1] for i in range(0,n//2)]
if n%2: b=[a[-1]]+list(reversed(b1))+b2
else: b=list(reversed(b2))+b1
print((" ".join(b))) | p03673 |
from functools import reduce
import math
def main():
# 文字列の2進数を数値にする
# '101' → '5'
# 文字列の頭に'0b'をつけてint()にわたす
# binary = int('0b'+'101',0)
# 2進数で立っているbitを数える
# 101(0x5) → 2
# cnt_bit = bin(5).count('1')
# N! を求める
# f = math.factorial(N)
# 切り捨て
# 4 ... | from functools import reduce
import math
def main():
# 文字列の2進数を数値にする
# '101' → '5'
# 文字列の頭に'0b'をつけてint()にわたす
# binary = int('0b'+'101',0)
# 2進数で立っているbitを数える
# 101(0x5) → 2
# cnt_bit = bin(5).count('1')
# N! を求める
# f = math.factorial(N)
# 切り捨て
# 4 ... | p03673 |
n = int(eval(input()))
A = [int(i) for i in input().split()]
b = str(A[0])
for i in range(1, n):
if i % 2 == n % 2:
b += " " + str(A[i])
else:
b = str(A[i]) + " " + b
print(b) | n = int(eval(input()))
A = [int(i) for i in input().split()]
if n % 2 != 0:
r = A[1::2]
l = A[::2]
else:
r = A[::2]
l = A[1::2]
l.reverse()
print((" ".join(map(str, l + r)))) | p03673 |
n=int(eval(input()))
a=input().split()
b=[]
for i in range(n):
b.append(a[i])
b.reverse()
print((' '.join(b)))
| n=int(eval(input()))
a=input().split()
a_even=[a[i] for i in range(0,n,2)]
a_odd=[a[i] for i in range(1,n,2)]
if n%2==1:
a_even.reverse()
ans=' '.join(a_even) +' ' + ' '.join(a_odd)
print(ans)
else:
a_odd.reverse()
ans=' '.join(a_odd)+' '+' '.join(a_even)
print(ans)
| p03673 |
from collections import deque
n=int(input())
a=[int(i) for i in input().split()]
ans=deque([])
for i in a:
ans.append(i)
ans=list(reversed(ans))
print(*ans,sep=' ')
| from collections import deque
n=int(input())
a=[int(i) for i in input().split()]
ans=deque([])
for i,j in enumerate(a):
if n%2==i%2:
ans.append(j)
else:
ans.appendleft(j)
print(*ans,sep=' ')
| p03673 |
from collections import deque
N= eval(input())
a = input().split()
#print a
d=deque()
for i,val in enumerate(a):
if i%2==1:
d.append(val)
else:
d.appendleft(val)
else:
#print d
d_str=""
if N%2==0:
for j in range(N):
d_str=d_str+d.pop()+" "
else:
for j in range(N):
d_str=d_str+d.p... | n= eval(input())
a = list(map(int,input().split()))
#print a
l=[ i for i in range(n)]
l_gusu=l[0::2]
l_kisu=l[1::2]
ans=[]
for i in reversed(list(l_gusu)):
#print i,a[i]
ans.append(a[i])
for i in l_kisu:
ans.append(a[i])
ans_str=""
if n%2==0:
for i in reversed(list(ans)):
ans_str+=(str(i)... | p03673 |
n=int(eval(input()))
a=list(map(int,input().split()))
b=[]
for i in range(n):
if i%2==0:
b.append(a[i])
else:
b.insert(0, a[i])
if n%2!=0:
b.reverse()
print((' '.join(map(str,b))))
| n=int(eval(input()))
a=list(map(int,input().split()))
odd = []
even = []
for i in range(n):
if i%2==0:
even.append(a[i])
else:
odd.append(a[i])
if n%2!=0:
b=even[::-1]+odd
else:
b=odd[::-1]+even
print((' '.join(map(str,b))))
| p03673 |
n = int(eval(input()))
a = list(map(int, input().split()))
b = []
for i in range(n):
b.append(a[i])
b = b[::-1]
b=[str(c) for c in b]
b=" ".join(b)
print(b) | n = int(eval(input()))
a = list(map(int, input().split()))
b = []
m1 = n//2
if n%2==0:
for i in range(m1):
b.append(a[n-1-2*i])
for i in range(m1):
b.append(a[2*i])
else:
for i in range(m1+1):
b.append(a[n-1-2*i])
for i in range(m1):
b.append(a[1+2*i])
b=[str(c)... | p03673 |
n = int(eval(input()))
a = list(map(int, input().split()))
b = []
for i in range(n):
if n % 2 == i % 2:
b.append(a[i])
else:
b.insert(0, a[i])
b = [str(bb) for bb in b]
b = ' '.join(b)
print(b) | n = int(eval(input()))
a = list(map(int, input().split()))
b1 = []
b2 = []
m = n % 2
for i in range(n):
if i % 2 == m:
b1.append(a[i])
else:
b2.append(a[i])
b2 = b2[::-1]
b = b2 + b1
b = [str(bb) for bb in b]
b = ' '.join(b)
print(b) | p03673 |
n = int(input().rstrip())
a = list(map(int, input().split()))
b = []
for i in range(n):
b.append(a[i])
b.reverse()
ans = list(map(str, b))
print(' '.join(ans))
| n = int(input().rstrip())
a = list(map(int, input().split()))
a_odd = a[0::2]
a_even = a[1::2]
a_even.reverse()
a_even.extend(a_odd)
b = list(map(str, a_even))
if len(b) % 2 !=0:
b.reverse()
print(' '.join(b))
| p03673 |
n = int(eval(input()))
a = list(input().split())
ans = a[0]
for i in range(1, n):
if i%2==n%2:
ans += " " + a[i]
else:
ans = a[i] + " " + ans
print(ans) | n=int(eval(input()))
a=list(input().split())
print((" ".join(a[::-2]+a[n%2::2]))) | p03673 |
n = int(eval(input()))
a = list(map(int, input().split()))
b = []
for i in range(n):
if i % 2 == 0:
b.append(a[i])
else:
b.insert(0, a[i])
if n % 2 == 1:
b.reverse()
print((" ".join(map(str, b)))) | n = int(eval(input()))
a = list(map(int, input().split()))
b = [0] * ((n + 1) // 2)
c = [0] * (n // 2)
for i in range(n):
if i % 2 == 0:
b[i // 2] = a[i]
else:
c[i // 2] = a[i]
if n % 2 == 0:
c.reverse()
s = c + b
else:
b.reverse()
s = b + c
print((" ".join(map(str... | p03673 |
import sys
import collections
ns = lambda: sys.stdin.readline().rstrip()
ni = lambda: int(ns())
nm = lambda: list(map(int, sys.stdin.readline().split()))
nl = lambda: list(nm())
nsl = lambda: list(map(str, sys.stdin.readline().split()))
n = ni()
a = nl()
ans = []
if n % 2 == 0:
for i in range(n):
... | import sys
import collections
ns = lambda: sys.stdin.readline().rstrip()
ni = lambda: int(ns())
nm = lambda: list(map(int, sys.stdin.readline().split()))
nl = lambda: list(nm())
nsl = lambda: list(map(str, sys.stdin.readline().split()))
n = ni()
a = collections.deque(nl())
ans = collections.deque()
if n % 2... | p03673 |
n = int(eval(input()))
a = list(input().split())
b = []
for i in range(n):
b.append(a[i])
b = b[::-1]
print((' '.join(b))) | n = int(eval(input()))
a = list(input().split())
print((' '.join(a[::-2] + a[n%2::2]))) | p03673 |
N = int(eval(input()))
A = list(map(int, input().split()))
ans = ""
if N % 2 == 0:
for i in range(N-1, -1, -2):
ans += str(A[i])
ans += " "
for i in range(0, N, 2):
ans += str(A[i])
if i != N - 2:
ans += " "
else:
for i in range(N-1, -2, -2):
ans += str(A[i])
ans += " "... | N = int(input())
A = list(map(int, input().split()))
if N % 2 == 0:
for i in range(N-1, -1, -2):
print(A[i], end = "")
print(" ", end = "")
for i in range(0, N, 2):
print(A[i], end = "")
if i != N - 2:
print(" ", end = "")
else:
print("")
else:
for i in range(N-1, -2, ... | p03673 |
n = int(eval(input()))
lis = []
li = list(map(str,input().split()))
if n % 2 == 0:
b = li[1::2]
for m in range(n//2):lis.append(b[-(m + 1)])
print((" ".join(lis[::] + li[::2])))
else:
b = li[::2]
for m in range((n//2)+1):lis.append(b[-(m + 1)])
print((" ".join(lis[::]+li[1::2]))) | n = int(eval(input()))
lis = list(map(str,input().split()))
li = lis[::2]
l = lis[1::2]
if n % 2 == 0:
l = l[::-1]
ans = l+li
print((" ".join(ans)))
else:
li = li[::-1]
ans = li+l
print((" ".join(ans)))
| p03673 |
n = int(input())
a = [int(i) for i in input().split()]
b = []
for i in range(n):
b.append(a[i])
b.reverse()
for i in range(n):
if i < n-1:
print(b[i],end=" ")
else:
print(b[i])
| n = int(input())
a = [int(i) for i in input().split()]
b = a[n::-2]+a[::2] if n%2 == 0 else a[n::-2]+a[1::2]
for i in range(n):
if i < n-1:
print(b[i],end=" ")
else:
print(b[i])
| p03673 |
n = int(eval(input()))
a = input().split()
b = []
ct = 0
for i in range(n):
if (ct%2) ==0:
b .append(a[i])
else:
b.insert(0,a[i])
ct += 1
if((n%2)==0):
print((" ".join([i for i in b])))
else:
print((" ".join([i for i in b[::-1]]))) | n = int(eval(input()))
a = input().split()
b = [0]*n
if (n%2) == 0:
for i in range(n):
if(i<(n//2)):
b[i] = a[n-(2*i)-1]
else:
b[i] = a[(i-(n//2))*2]
else:
for i in range(n):
if(i<(n//2)):
b[i] = a[n-(2*i)-1]
elif i == (n//2):
... | p03673 |
n = int(input())
S = list(map(int, input().split()))
b=[]
if len(S)%2==0:
for i in range(n):
if i%2==0:
b.append(S[i])
else:
b.insert(0, S[i])
else:
for i in range(n):
if i%2!=0:
b.append(S[i])
else:
b.insert(0, S[i])
... | n = int(input())
S = list(map(int, input().split()))
S=S[::-1]
x=S[::2]
y=S[1::2]
b=x+y[::-1]
print(*b, sep=" ")
| p03673 |
n = int(eval(input()))
a = list(map(int, input().split()))
b = []
for i in range(n):
b.append(a[i])
b = b[::-1]
print((' '.join(map(str, b)))) | n = int(eval(input()))
a = list(map(int, input().split()))
b = []
if n % 2 == 0:
for i in range(n//2):
b.append(a[-1-i*2])
for i in range(n//2):
b.append(a[i*2])
else:
for i in range(n//2+1):
b.append(a[-1-i*2])
for i in range(0, n//2):
b.append(a[1+i*2])
p... | p03673 |
N = int(eval(input()))
A = list(input().split())
# B = [0 for i in range(N)]
B = []
for i in range(N):
B.append(A[i])
B = B[::-1]
print((' '.join(B))) | N = int(eval(input()))
A = list(input().split())
# B = [0 for i in range(N)]
med = N // 2
B = ['0' for i in range(N)]
fo = []
# for i in range(med, N):
# fo.append
if N % 2 == 0:
f_c = med
for i in range(0, N, 2):
B[f_c] = A[i]
f_c += 1
# print(f_c)
# print(B)
... | p03673 |
n = int(eval(input()))
A = list(map(int, input().split()))
L = []
for a in A:
L.append(a)
L.reverse()
s = str(L[0])
for i in range(1, len(L)):
s = s + " " + str(L[i])
print(s) | n = int(eval(input()))
A = list(input().split())
B = ""
m = n//2
if n%2 == 0:
for i in range(m):
B += A[n-1-2*i]
B += " "
for i in range(m):
B += A[i*2]
B += " "
else:
for i in range(m+1):
B += A[n-1-2*i]
B += " "
for i in range(m):
B += A[i*2+1]
B += " "
print(... | p03673 |
n=int(eval(input()))
a=list(input().split())
if n==1:
print((a[0]))
exit()
bl=a[-1]
br=a[-2]
for i in range(2,n):
if i%2==0:
bl+=' '+a[-1-i]
else:
br=a[-1-i]+' '+br
bl+=' '+br
print(bl) | n=int(eval(input()))
a=list(input().split())
if n==1:
print((a[0]))
exit()
bl=[a[-1]]
br=[a[-2]]
for i in range(2,n):
if i%2==0:
bl.append(a[-1-i])
else:
br.append(a[-1-i])
m=len(br)
br=[br[-i-1] for i in range(m)]
bl[len(bl):len(bl)]=br
print((' '.join(bl)))
| p03673 |
n = int(eval(input()))
a = [int(x) for x in input().split()]
b = []
for i in range(n):
if n % 2 != i % 2:
b.insert(0, a[i])
else:
b.append(a[i])
print((' '.join(map(str, b)))) | n = int(eval(input()))
a = input().split()
a_odd = a[1::2]
a_even = a[0::2]
if n % 2 == 0:
a_odd.reverse()
ans = a_odd + a_even
else:
a_even.reverse()
ans = a_even + a_odd
print((' '.join(ans))) | p03673 |
n = int(eval(input()))
a = list(input().split())
b = []
for i in range(n):
if i % 2 == 0:
b.append(a[i])
else:
b.insert(0, a[i])
if n % 2 == 1:
b.reverse()
print((" ".join(b)))
| n = int(eval(input()))
a = list(input().split())
b = []
if n % 2 == 0:
for i in range(n//2):
b.append(a[n-1-i*2])
for i in range(n//2):
b.append(a[i*2])
else:
for i in range(n//2+1):
b.append(a[n-i*2-1])
for i in range(n//2):
b.append(a[i*2+1])
print((" ".join(b)))
| p03673 |
n = int(eval(input()))
listA = list(map(int, input().split()))
listB=[]
index=0
while index < n:
a = listA[index]
if index%2==0:
listC=[a]
listC.extend(listB)
listB=listC
else:
listB.append(a)
index+=1
if n%2==0:
listB.reverse()
print((" ".join(list... | n = int(eval(input()))
listA = list(map(int, input().split()))
stA=""
if n%2 == 0:
index = len(listA)-1
while index > 0:
if index== len(listA)-1:
stA +=str(listA[index])
else:
stA+=" "+str(listA[index])
index-=2
index = 0
while index < len(li... | p03673 |
n=int(eval(input()))
nums=input().split()
b=list()
for var in range(0,n):
b.append(nums[var])
b=b[::-1]
ans=" ".join(b)
print(ans) | n=int(eval(input()))
nums=input().split()
n1=nums[::2]
n2=nums[1::2]
if len(nums)%2==0:
ans=" ".join(n2[::-1])+" "+" ".join(n1)
else:
ans = " ".join(n1[::-1]) + " " + " ".join(n2)
print(ans) | p03673 |
def main():
n = int(eval(input()))
a = input().split()
ans = []
add = ans.append
rev = ans.reverse
for i in range(n):
add(a[i])
rev()
print((" ".join(ans)))
if __name__=="__main__": main() | def main():
n = int(eval(input()))
a = input().split()
if n%2: ans = a[n-1::-2] + a[1:n-1:2]
else: ans = a[n-1:0:-2] + a[0:n-1:2]
print((" ".join(ans)))
if __name__=="__main__": main() | p03673 |
N = int(eval(input()))
A = list(map(int, input().split()))
index = []
if N % 2 == 0:
for i in range(N - 1, 0, -2):
index.append(i)
for j in range(0, N - 1, 2):
index.append(j)
else:
for i in range(N - 1, -1, -2):
index.append(i)
for j in range(1, N - 1, 2):
... | N = int(eval(input()))
A = list(map(str, input().split()))
B = A[::2][::-1] + A[1::2]
if N % 2 == 0:
B = B[::-1]
print((' '.join(B))) | p03673 |
N=int(eval(input()))
li=list(map(int,input().split()))
ans=[]
if N%2==0:
for n in range(N):
if n%2==0:
ans.append(str(li[n]))
else:
ans.insert(0,str(li[n]))
else:
for n in range(N):
if n%2==0:
ans.insert(0,str(li[n]))
else:
... | N=int(eval(input()))
li=list(map(int,input().split()))
ans_odd=[]
ans_even=[]
if N%2==0:
ans_normal=li[::2]
ans_rev=li[1::2]
else:
ans_rev=li[::2]
ans_normal=li[1::2]
ans_rev.reverse()
ans=ans_rev+ans_normal
for n in range(N):
ans[n]=str(ans[n])
print((' '.join(ans)))
| p03673 |
n = int(eval(input()))
a = []
for i in input().split():
a.append(i)
a = a[::-1]
print((" ".join(list(map(str, a)))))
| n=int(eval(input()))
a=[i for i in input().split()]
b=[]
c=[]
if n%2==0:
for i in range(n):
if i%2==0:
b.append(a[i])
else:
c.append(a[i])
else:
for i in range(n):
if i%2==0:
c.append(a[i])
else:
b.append(a[i])
c=c... | p03673 |
#-*-coding:utf-8-*-
def main():
n = int(eval(input()))
a_list = list(map(int, input().split()))
b = []
for i in range(n):
if i % 2 != 0:
b.insert(0, a_list[i])
else:
b.append(a_list[i])
if len(a_list) % 2 != 0:
b = b[::-1]
print((' ... | #-*-coding:utf-8-*-
def main():
n = int(eval(input()))
a_list = list(map(int, input().split()))
p = [a_list[i] for i in range(0, n, 2)]
q = [a_list[i] for i in range(1, n, 2)]
if n % 2 == 0:
print((' '.join(map(str, q[::-1] + p))))
else:
print((' '.join(map(str, p[::... | p03673 |
n = int(eval(input()))
a = input().split()
b = []
if n % 2:
for i in range(n):
if i % 2 == 0:
b = [a[i]] + b
else:
b.append(a[i])
print((" ".join(b)))
else:
for i in range(n):
if i % 2:
b = [a[i]] + b
else:
b.appe... | n = int(eval(input()))
a = input().split()
if n % 2 == 0:
b = a[::-2] + a[::2]
else:
b = a[::-2] + a[1::2]
print((" ".join(b))) | p03673 |
n = int(eval(input()))
a = list(map(int, input().split()))
b = []
for i in range(n):
b.append(a[i])
b = b[:: -1]
print((" ".join(map(str, b))))
| n = int(eval(input()))
a = list(map(int, input().split()))
b = []
if n % 2 == 0:
b = a[1:: 2][:: -1] + a[:: 2]
print((" ".join(map(str, b))))
else:
b = a[:: 2][:: -1] + a[1:: 2]
print((" ".join(map(str, b))))
| p03673 |
n = int(eval(input()))
a = input().split()
b = []
for i in range(n):
b.append(a[i])
b.reverse()
print((" ".join(b))) | n = int(eval(input()))
a = input().split()
a_odd = a[0::2]
a_even = a[1::2]
if n % 2 == 1:
print((" ".join(a_odd[::-1] + a_even)))
else:
print((" ".join(a_even[::-1] + a_odd))) | p03673 |
N = int(eval(input()))
ARR = [int(s) for s in input().split(" ")]
def calculate(n,arr):
left = list([])
right = list([])
if n % 2 == 0:
for index,ar in enumerate(arr):
if index % 2 == 0:
right.append(str(ar))
else:
left.insert(0,str... | N = int(eval(input()))
ARR = [int(s) for s in input().split(" ")]
def calculate(n,arr):
left = list([])
right = list([])
if n % 2 == 0:
for index,ar in enumerate(arr):
if index % 2 == 0:
right.append(str(ar))
else:
left.append(str(a... | p03673 |
n = int(eval(input()))
a = list(map(int,input().split()))
s = []
for i in range(n):
s.append(a[i])
s.reverse()
s = list(map(str,s))
print((' '.join(s)))
| n = int(eval(input()))
a = list(map(int,input().split()))
q = a[-1]
s = []
for i in range(n):
s.append(0)
if n%2==1:
for i in range(n//2+1):
s[i]=a[-1-2*i]
for i in range(n//2):
s[n//2+1+i]=a[2*i+1]
else:
for i in range(n//2):
s[i]=a[-1-2*i]
for i in range(n//2):
s[n//2+i]=a[2*i]
s = ... | p03673 |
n = int(eval(input()))
a = list(map(int,input().split()))
ans=[]
[ans.append(a[i]) if i%2 ==0 else ans.insert(0,a[i]) for i in range(n)]
print((str(ans).replace("[","").replace("]","").replace(",","") if n%2 ==0 else str(ans[::-1]).replace("[","").replace("]","").replace(",","") )) | n = int(eval(input()))
a = list(map(int,input().split()))
ans=[0]*n
for i in range(n):
if i%2 ==0:
ans[n//2+i//2]=a[i]
else:
ans[n//2-i//2-1]=a[i]
print((str(ans).replace("[","").replace("]","").replace(",","") if n%2 ==0 else str(ans[::-1]).replace("[","").replace("]","").replace(",","") )) | p03673 |
from collections import deque
def main():
n, *a = open(0).read().split()
dq = deque()
n = int(n) - 1
for i, ai in enumerate(a):
if i % 2 == n % 2:
dq.appendleft(ai)
else:
dq.append(ai)
print((" ".join(dq)))
return
main()
| def main():
n, *a = open(0).read().split()
if int(n) % 2:
print(" ".join(reversed(a[0::2])), end=" ")
print(" ".join(a[1::2]))
else:
print(" ".join(reversed(a[1::2])), end=" ")
print(" ".join(a[0::2]))
return
main()
| p03673 |
n = int(eval(input()))
l = list(map(int, input().split()))
even, odd = [], []
for i in range(n):
if i % 2 == 0:
even.append(l[i])
else:
odd.append(l[i])
if n % 2 == 0:
ans = odd[::-1] + even
else:
ans = even[::-1] + odd
ans = list(map(str, ans))
print((' '.join(ans))) | n = int(eval(input()))
l = list(map(int, input().split()))
a = []
b = []
for i in range(n):
if i % 2 == 0:
a.append(l[i])
else:
b.append(l[i])
if n % 2 == 0:
ans = b[::-1] + a
print((' '.join(map(str, ans))))
else:
ans = a[::-1] + b
print((' '.join(map(str, ans)))) | p03673 |
n = int(eval(input()))
a = list(map(int, input().split()))
b=[]
for i in range(n):
b.append(a[i])
b.reverse()
s = ""
for b_ in b:
s+=str(b_)
s+=" "
s=s.rstrip()
print(s)
| n = int(eval(input()))
a = list(map(int, input().split()))
b1=[]
b2=[]
for i in range(int((n+1)/2)):
i*=2
b1.append(a[i])
i+=1
if i!=n:
b2.append(a[i])
s = ""
if n%2==1:
b3=b2
b2=b1
b1=b3
b2.reverse()
for b_ in b2:
s+=str(b_)
s+=" "
for b_ in b1:
... | p03673 |
n = int(eval(input()))
a = list(input().split())
b = []
for i in range(n):
if i % 2 == 0:
b.append(a[i])
else:
b.insert(0, a[i])
if n % 2 == 1:
b = list(reversed(b))
print((' '.join(b))) | n = int(eval(input()))
a = list(input().split())
b = ['' for _ in range(n)]
m = n // 2
b[m] = a[0]
p = 1
for i in range(1, n):
if i % 2 == 1:
b[m - p] = a[i]
else:
b[m + p] = a[i]
p += 1
if n % 2 == 1:
b = list(reversed(b))
print((' '.join(b))) | p03673 |
n = int(eval(input()))
a = input().split(' ')
b = []
for i in range(n):
b.append(a[i])
b = b[::-1]
print((' '.join(b))) | n = int(input())
a = input().split(' ')
b = []
inds = [0] * n
for i in range(int(n/2)):
inds[i] = n-2*i
inds[n-1-i] = n-2*i-1
if n % 2 == 1:
inds[int(n/2)] = n-2*int(n/2)
for i, ind in enumerate(inds):
print(a[ind-1], end="")
if i != n-1:
print(' ', end="")
print('')
| p03673 |
n = int(eval(input()))
a = list(map(str, input().split()))
b = []
for i in a:
b.append(i)
b = list(reversed(b))
print((" ".join(b))) | n = int(eval(input()))
a = list(map(str, input().split()))
b = []
if n%2 == 0:
print((" ".join(a[1::2][::-1]+a[0::2])))
else:
print((" ".join(a[0::2][::-1]+a[1::2]))) | p03673 |
import sys
from collections import deque
sys.setrecursionlimit(10**6)
if sys.platform in (['ios','darwin','win32']):
sys.stdin=open('Untitled.txt')
input = sys.stdin.readline
def INT(): return int(eval(input()))
def MAP(): return [int(s) for s in input().split()]
N = INT()
A = MAP()
B = deque([])
# ... | import sys
from collections import deque
sys.setrecursionlimit(10**6)
if sys.platform in (['ios','darwin','win32']):
sys.stdin=open('Untitled.txt')
input = sys.stdin.readline
def INT(): return int(eval(input()))
def MAP(): return [int(s) for s in input().split()]
N = INT()
A = MAP()
B = deque([])
# ... | p03673 |
n = int(eval(input()))
a = list(map(int, input().split()))
b = []
for i in range(n):
b.append(a[i])
b.reverse()
b = list(map(str, b))
print((' '.join(b))) | n = int(eval(input()))
a = list(map(int, input().split()))
a_even = a[0::2]
a_odd = a[1::2]
# even
if (n - 1) % 2 == 0: # 0-(n-1)の実施なので(n-1)の偶奇を判定
b = a_even.copy()
b.reverse()
b = b + a_odd
# odd
else:
b = a_odd.copy()
b.reverse()
b = b + a_even
b = list(map(str, b))
prin... | p03673 |
n = int(eval(input()))
a = list(map(int, input().split()))
ans = []
if n % 2 == 0:
for i in range(n):
if i % 2 == 0:
ans.append(a[i])
else:
ans.insert(0, a[i])
else:
for i in range(n):
if i % 2 != 0:
ans.append(a[i])
else:
... | n = int(eval(input()))
a = list(map(int, input().split()))
ev = a[1::2]
od = a[::2]
if n % 2 == 0:
ev = ev[::-1]
ans = ev + od
else:
od = od[::-1]
ans = od + ev
print((" ".join(map(str, ans)))) | p03673 |
iN = int(eval(input()))
aA = [int(_) for _ in input().split()]
if iN == 1:
print((aA[0]))
elif iN % 2 == 0:
print((" " .join([str(_) for _ in list(reversed(aA[1::2])) + aA[0::2] ])))
else:
print((" " .join([str(_) for _ in list(reversed(aA[0::2])) + aA[1::2] ])))
| iN = int(eval(input()))
aA = [int(_) for _ in input().split()]
if iN == 1:
print((aA[0]))
else:
print((" " .join([str(_) for _ in aA[-1::-2] + aA[iN%2::2] ])))
| p03673 |
iN = int(eval(input()))
aA = [int(_) for _ in input().split()]
if iN == 1:
print((aA[0]))
else:
print((" " .join([str(_) for _ in aA[-1::-2] + aA[iN%2::2] ])))
| iN = int(eval(input()))
aA = input().rstrip().split()
if iN == 1:
print((aA[0]))
else:
print((" " .join(aA[-1::-2] + aA[iN%2::2])))
| p03673 |
N = int(eval(input()))
a = list(map(int,input().split()))
b = []
for i in range(N):
b.append(a[i])
b.reverse()
print((' '.join(map(str,b)))) | N = int(eval(input()))
a = list(map(int,input().split()))
b = [0]*N
if N % 2 == 0:
for i in range(N):
if (i+1) %2 == 1:
b[N//2+(i+1)//2] = a[i]
else:
b[N//2-(i+1)//2] = a[i]
else:
for i in range(N):
if (i+1) %2 == 1:
b[(N-1)//2-(i+1)//2] = a[i]
else:
b[(N-1)//2+... | p03673 |
n = int(eval(input()))
a = list(map(int,input().split()))
b = []
for i in range(n):
if i%2 == 0:
b.append(a[i])
else:
b.insert(0,a[i])
if n%2 == 0:
print((" ".join(list(map(str,b)))))
else:
c = []
for i in range(n-1,-1,-1):
c.append(b[i])
print((" ".join(lis... | n = int(eval(input()))
a = list(map(int,input().split()))
9753102468
na = n-1
if na%2 == 0:
nl = na-1
nr = na
else:
nl = na
nr = na-1
b = []
for i in range(nl,0,-2):
b.append(i)
for i in range(0,nr+1,2):
b.append(i)
ans = [0 for i in range(n)]
for i,k in enumerate(b):
if... | p03673 |
# coding: utf-8
def get_ln_inputs():
return input().split()
def get_ln_int_inputs():
return list(map(int, get_ln_inputs()))
def main():
n = get_ln_int_inputs()[0]
a = get_ln_int_inputs()
reverse = n % 2 == 0
result = list()
for i in range(n):
ii = len(result) if ... | # coding: utf-8
def get_ln_inputs():
return input().split()
def get_ln_int_inputs():
return list(map(int, get_ln_inputs()))
def main():
n = get_ln_int_inputs()[0]
a = get_ln_int_inputs()
ilist = []
t = n
while t > 0:
ilist.append(t)
t -= 2
if t ==... | p03673 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.