input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
rot = {
"North": (1,5,2,3,0,4),
"East" : (3,1,0,5,4,2),
"West" : (2,1,5,0,4,3),
"South": (4,0,2,3,5,1),
"Right": (0,2,4,1,3,5),
"Left" : (0,3,1,4,2,5)
}
while 1:
n = eval(input())
if not n:
break
dice = [1,2,3,4,5,6]
nxt = [0]*6
ans = 0
for i in ran... | rot = {
"North": (1,5,2,3,0,4),
"East" : (3,1,0,5,4,2),
"West" : (2,1,5,0,4,3),
"South": (4,0,2,3,5,1),
"Right": (0,2,4,1,3,5),
"Left" : (0,3,1,4,2,5)
}
while 1:
n = eval(input())
if not n:
break
dice = [1,2,3,4,5,6]
nxt = [0]*6
ans = 0
for i in ran... | p00425 |
import sys,time
n = 104730
a = [True] * n
a[0] = a[1] = False
for i in range(2,n):
if(a[i]):
for j in range(i+i, n, i):
a[j] = False
a = [i[0] for i in enumerate(a) if i[1]]
for s in sys.stdin:
n = int(s)
if n == 0:
exit()
print((sum(a[:n]))) | import sys
n = 104730
a = [True] * n
a[0] = a[1] = False
for i in range(2,n):
if(a[i]):
for j in range(i+i, n, i):
a[j] = False
a = [i[0] for i in enumerate(a) if i[1]]
for s in sys.stdin:
n = int(s)
if n == 0:
exit()
print((sum(a[:n]))) | p00053 |
s = [0]
M = 10**6
p = [1]*M
S = 0
for i in range(2,M):
if p[i]:
for j in range(i*i,M,i):
p[j] = 0
S += i; s.append(S)
while 1:
n = eval(input())
if n==0: break
print(s[n]) | s = [0]
M = 104850
p = [1]*M
S = 0
for i in range(2,M):
if p[i]:
for j in range(i*i,M,i):
p[j] = 0
S += i; s.append(S)
while 1:
n = eval(input())
if n==0: break
print(s[n]) | p00053 |
# -*- coding: utf-8 -*-
import sys
import os
def is_prime(n):
if n==2 or n==3: return True
if n%2==0 or n<2: return False
for i in range(3,int(n**0.5)+1,2): # only odd numbers
if n%i==0:
return False
return True
def make_primes():
primes = [2]
i = 3
w... | # -*- coding: utf-8 -*-
import sys
import os
def is_prime_list():
N = 105000
lst = [True] * N
lst[0] = False
lst[1] = False
for i in range(2, int(N ** 0.5) + 1):
if lst[i] == True:
for j in range(2, N):
index = i * j
if index < N:
... | p00053 |
def isPrime(x):
if x == 2:
return True
if x < 2 or x % 2 == 0:
return False
i, root_x = 3, int(pow(x, 0.5))
while i <= root_x:
if x % i == 0:
return False
i += 2
return True
primes = [2]
for i in range(3, 104730):
if isPrime(i):
... | primes = [0, 0] + [1] * 150000
for i in range(2, 388):
if primes[i]:
for j in range(i*i, 150001, i):
primes[j] = 0
values = [i for i, v in enumerate(primes) if v]
while True:
n = int(eval(input()))
if n == 0:
break
print((sum(values[:n]))) | p00053 |
import math
r = 200000
sqrt = int(math.sqrt(r))
p = [1]*r
p[0] = 0
for i in range(1,sqrt):
if p[i]:
for j in range(2*i+1,r,i+1):
p[j] = 0
while True:
n = int(input())
if not n:
break
i, num, sum = 0, 0, 0
while num < n:
if p[i] == 1:
... | import math
r = 105000
sqrt = int(math.sqrt(r))
p = [1]*r
p[0] = 0
for i in range(1,sqrt):
if p[i]:
for j in range(2*i+1,r,i+1):
p[j] = 0
while True:
n = int(input())
if not n:
break
i, num, sum = 0, 0, 0
while num < n:
if p[i] == 1:
... | p00053 |
import math
r = 105000
sqrt = int(math.sqrt(r))
p = [1]*r
p[0] = 0
for i in range(1,sqrt):
if p[i]:
for j in range(2*i+1,r,i+1):
p[j] = 0
s = [0 for i in range(11000)]
s[0] = 2
k = 1
for i in range(2,r):
if p[i]:
s[k] = i+1+s[k-1]
k += 1
while Tr... | import math
r = 105000
sqrt = int(math.sqrt(r))
p = [1]*r
p[0] = 0
for i in range(1,sqrt):
if p[i]:
p[2*i+1::i+1] = [0 for x in range(2*i+1,r,i+1)]
s = [0 for i in range(11000)]
s[0] = 2
k = 1
for i in range(2,r):
if p[i]:
s[k] = i+1+s[k-1]
k += 1
while True:... | p00053 |
prim=[True]*1000000
prim[0],prim[1]=False,False
for i in range(2,1000):
if prim[i]:
for j in range(i*2,1000000,i):
prim[j]=False
prime=[i for i,j in enumerate(prim) if j==True]
while True:
n=int(eval(input()))
if n==0:
break
print((sum(prime[:n]))) | prim=[True]*1000000
prim[0]=prim[1]=False
for i in range(2,350):
if prim[i]:
for j in range(i*2,110000,i):
prim[j]=False
prime=[i for i,j in enumerate(prim) if j==True]
while True:
n=int(eval(input()))
if n==0:
break
print((sum(prime[:n]))) | p00053 |
import math
def pri(n):
if n < 2:
return False
elif n == 2:
return True
elif n % 2 == 0:
return False
i = 3
while i <= math.sqrt(n):
if n % i == 0:
return False
i += 2
return True
l=[i for i in range(110000)if pri(i) ]
whil... | import math
def pri(n):
l =[True] * n
l[0] = l[1] = False
for i in range(2,n):
if l[i]:
for j in range(i*2, n, i):
l[j] = False
return l
n=105000
s=pri(n)
l=[i for i in range(n) if s[i]]
while True:
n = int(eval(input()))
if n == 0: break
pr... | p00053 |
def create_prime_list(limit):
""" ??¨??????????????????????????§limit?????§????´???°?????????????±???????
https://ja.wikipedia.org/wiki/%E3%82%A8%E3%83%A9%E3%83%88%E3%82%B9%E3%83%86%E3%83%8D%E3%82%B9%E3%81%AE%E7%AF%A9
"""
x = limit**0.5
primes = []
#print('x={0}'.format(x))
nums = [x ... | def create_prime_list(limit):
""" ??¨??????????????????????????§limit?????§????´???°?????????????±???????
https://ja.wikipedia.org/wiki/%E3%82%A8%E3%83%A9%E3%83%88%E3%82%B9%E3%83%86%E3%83%8D%E3%82%B9%E3%81%AE%E7%AF%A9
"""
x = limit**0.5
primes = []
#print('x={0}'.format(x))
nums = [x ... | p00053 |
from math import sqrt, ceil, pow
class SieveOfAtkin:
""" ??¢???????????????
https://github.com/mccricardo/sieve_of_atkin/blob/master/sieve_of_atkin.py
"""
def __init__(self, limit):
self.limit = limit
self.primes = []
self.sieve = [False] * (self.limit + 1)
def f... | from math import sqrt, ceil, pow
class SieveOfAtkin:
""" ??¢???????????????
https://github.com/mccricardo/sieve_of_atkin/blob/master/sieve_of_atkin.py
"""
def __init__(self, limit):
self.limit = limit
self.primes = []
self.sieve = [False] * (self.limit + 1)
def f... | p00053 |
from math import sqrt
while True :
sample = int(eval(input()))
if sample == 0 : break
Sum, count, number = 2, 1, 1
while True :
if count == sample : break
if 2 < number :
temp, switch = 3, 0
while temp <= sqrt(number) :
if number % temp... | prime = [2, 3]
while True :
Sum = 0
sample = int(eval(input()))
if sample == 0 : break
elif sample <= len(prime) :
Sum = sum(prime[:sample])
else :
Sum, temp, count = sum(prime), prime[-1], len(prime)
while True :
if sample == count : break
... | p00053 |
import re
s = re.split("[ .,]", input())
sl = len(s)
ans = list()
for i in range(sl) :
if(2 < len(s[i]) and len(s[i]) < 7) :
ans.append(s[i])
else :
pass
ansl = len(ans)
for i in range(ansl) :
if(i == ansl - 1) :
print(ans[i])
else :
print(ans[i], end = (" "))
| import re
I = input().split()
S = []
for i in range(len(I)) :
I[i] = re.split("[,.]", I[i])
if 2 < len(I[i][0]) and len(I[i][0]) < 7 :
S.append(I[i][0])
for i in range(len(S)) :
if i == len(S) - 1 :
print(S[i])
else :
print(S[i], " ", sep = "", end = "")
| p00084 |
s=" "
x=input().replace(",",s).replace(".",s).split()
print(s.join([w for w in x if 2<len(w)<7])) | s=" "
x=input().replace(",",s).replace(".",s).split()
x=s.join([w for w in x if 2<len(w)<7])
print(x) | p00084 |
n,m,*T=list(map(int,open(0).read().split()));*S,=list(zip(T[::2],T[1::2]));s=lambda e:set(sum([s for s in S if e in s],()));print(("IM"*(len(s(1)&s(n))<1)+"POSSIBLE")) | n,m,*T=list(map(int,open(0).read().split()));*S,=list(zip(T[::2],T[1::2]));s=lambda e:set(s[e<2]for s in S if e in s);print(("IM"*(len(s(1)&s(n))<1)+"POSSIBLE")) | p03647 |
N, M = list(map(int,input().split()))
G = [[] for _ in range(N)]
for _ in range(M):
a, b = list(map(int,input().split()))
a -= 1
b -= 1
G[a].append(b)
E = []
for v in G[0]:
if v in E:
continue
E.append(v)
for v2 in G[v]:
if v2 in E:
continue
... | N, M = list(map(int,input().split()))
S = [False for _ in range(N)]
G = [False for _ in range(N)]
for _ in range(M):
a, b = list(map(int,input().split()))
a -= 1
b -= 1
if a == 0 and b == N - 1:
print("POSSIBLE")
exit()
if a == 0:
if G[b]:
print("POSSI... | p03647 |
from collections import defaultdict, deque
INF = 10**12
N, M = list(map(int, input().split()))
E = defaultdict(list)
for _ in range(M):
a, b = list(map(int, input().split()))
E[a-1].append(b-1)
E[b-1].append(a-1)
dist = [INF]*N
q = deque([(0, 0)])
while q:
v, d = q.popleft()
dist[v] = ... | N, M = list(map(int, input().split()))
from_1 = [False]*N
to_N = [False]*N
for _ in range(M):
a, b = list(map(int, input().split()))
if a == 1:
from_1[b-1] = True
elif b == N:
to_N[a-1] = True
for i in range(1, N):
if from_1[i] and to_N[i]:
print('POSSIBLE')
b... | p03647 |
N, M = list(map(int,input().split()))
edges = [[] for _ in range(N)]
for i in range(M):
a, b = list(map(int,input().split()))
edges[a-1] += [b-1]
edges[b-1] += [a-1]
res = False
for u in edges[0]:
if u in edges[N-1]:
res = True
break
print(("POSSIBLE" if res == True else "IMPOSSIBLE")) | N, M = list(map(int,input().split()))
from1 = []
gotoN = []
for i in range(M):
a, b = list(map(int,input().split()))
if a == 1:
from1.append(b)
if b == N:
gotoN.append(a)
res = set(from1) & set(gotoN)
print(("POSSIBLE" if len(res) > 0 else "IMPOSSIBLE")) | p03647 |
from copy import *
from sys import *
from math import *
import queue
from collections import defaultdict,Counter,deque
setrecursionlimit(1000000)
def main():
n,m = list(map(int,input().split()))
ab = [list(map(int,input().split())) for _ in range(m)]
b = {}
for i in ab:
try:
b[i[0]].append(i[1]... | from copy import *
from sys import *
from math import *
import queue
from collections import defaultdict,Counter,deque
setrecursionlimit(1000000)
def main():
n, m = list(map(int,input().split()))
s=set()
t=set()
for _ in range(m):
a, b = list(map(int, input().split()))
if a == 1:
s.add(b)
... | p03647 |
import sys
n, m = list(map(int, sys.stdin.readline().split()))
set1, setn = set(), set()
for _ in range(m):
i, j = list(map(int, sys.stdin.readline().split()))
if i in [1, n] or j in [1, n]:
if i == 1:
set1.add(j)
if i == n:
setn.add(j)
if j == 1:
set1.add(i)
if j == n:... | import sys
def main():
n, m = list(map(int, sys.stdin.readline().split()))
set1, setn = set(), set()
for _ in range(m):
i, j = list(map(int, sys.stdin.readline().split()))
if i == 1:
set1.add(j)
if j == n:
setn.add(i)
if set1 & setn:
print('POSSIBLE')
else:
pri... | p03647 |
def f():
n,m = list(map(int,input().split(" ")))
s = []
w = [[] for i in range(n+2)]
for i in range(m):
a,b = list(map(int,input().split(" ")))
if a==1:
s.append(b)
if b==1:
s.append(a)
w[a].append(b)
w[b].append(a)
... | def f():
n,m = list(map(int,input().split(" ")))
s = []
w = [[] for i in range(n+2)]
for i in range(m):
a,b = list(map(int,input().split(" ")))
if a==1:
s.append(b)
if b==1:
s.append(a)
w[a].append(b)
w[b].append(a)
... | p03647 |
def main():
N,M = list(map(int,input().split()))
ships = sorted([list(map(int,input().split())) for i in range(M)])
ans = "IMPOSSIBLE"
con = 0
for i in range(M):
if ships[i][0] == 1:
con += 1
for i in range(0,min(M,con + 1)):
if ships[i][0] == 1:
ship = ships[i]... | def main():
N,M = list(map(int,input().split()))
ships = [list(map(int,input().split())) for i in range(M)]
start, goal = set(), set()
for i in range(M):
if ships[i][0] == 1:
start.add(ships[i][1])
if ships[i][1] == N:
goal.add(ships[i][0])
flg = start & goal
print(("POSSIBLE" ... | p03647 |
n = int(input())
pts = [[int(_) for _ in input().split()] for i in range(n)]
def dot(a, b):
return a[0] * b[0] + a[1] * b[1]
def cross(a, b):
return a[0] * b[1] - a[1] * b[0]
def norm(a):
return dot(a, a)
def dist2(a, b):
return norm(sub(a, b))
def sub(a, b):
return [a... | n = int(input())
pts = [complex(*[float(_) for _ in input().split()]) for i in range(n)]
def cross(a, b):
return (a.conjugate() * b).imag
pts.sort(key=lambda p: (p.imag, p.real))
right = []
for p in pts:
while len(right) >= 2 and cross(right[-1] - right[-2], p - right[-1]) < 0:
right.p... | p02300 |
def dfs(a,i,j,rest,vis):
if i<0 or len(a)<=i or j<0 or len(a[i])<=j: return False
if a[i][j]<0 or rest<a[i][j] or vis[i][j]: return False
vis[i][j]=1
rest-=a[i][j]
if rest==0:
if start(a,vis):
return True
else:
for di,dj in zip([-1,1,0,0],[0,0,-1,1]):
if dfs(a,i+di,j+dj,rest,vi... | def dfs(a,i,j,ss,si,rest,vis):
if i<0 or len(a)<=i or j<0 or len(a[i])<=j or vis[i][j]: return False
if a[i][j]<0 and (i,j)==ss[si]:
vis[i][j]=1
for di,dj in zip([-1,1,0,0],[0,0,-1,1]):
if dfs(a,i+di,j+dj,ss,si,-a[i][j],vis):
return True
vis[i][j]=0
elif a[i][j]>0 and rest>=a[i][... | p00620 |
def dfs(a,i,j,ss,si,rest,vis):
if i<0 or len(a)<=i or j<0 or len(a[i])<=j or vis[i][j]: return False
if a[i][j]<0 and (i,j)==ss[si]:
vis[i][j]=1
for di,dj in zip([-1,1,0,0],[0,0,-1,1]):
if dfs(a,i+di,j+dj,ss,si,-a[i][j],vis):
return True
vis[i][j]=0
elif a[i][j]>0 and rest>=a[i][... | di=(-1,1,0,0)
dj=(0,0,-1,1)
def solve(a,ss,i,j,si,rest,vis):
n=len(a)
if i<0 or n<=i or j<0 or n<=j or vis[i][j]: return False
if a[i][j]<0:
if ss[si]!=(i,j): return False
vis[i][j]=-1-si
for k in range(4):
ni,nj=i+di[k],j+dj[k]
if solve(a,ss,ni,nj,si,rest,vis): return True
... | p00620 |
x = int(eval(input()))
if x < 600:
print("8")
elif x < 800:
print("7")
elif x < 1000:
print("6")
elif x < 1200:
print("5")
elif x < 1400:
print("4")
elif x < 1600:
print("3")
elif x < 1800:
print("2")
elif x < 2000:
print("1") | x = int(eval(input()))
for i in range(2,10):
if i <= x/200 < i+1:
print((10-i)) | p02600 |
#!/usr/bin/env python3
# encoding:utf-8
import copy
import random
import bisect #bisect_left これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys
import collections
from decimal import Decimal # 10進数で考慮できる
mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000
d = collections.de... | #!/usr/bin/env python3
# encoding:utf-8
import copy
import random
import bisect #bisect_left これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys
import collections
from decimal import Decimal # 10進数で考慮できる
mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000
d = collections.de... | p02600 |
x = int(eval(input()))
lank8 = list(range(400, 600))
lank7 = list(range(400, 800))
lank6 = list(range(400, 1000))
lank5 = list(range(400, 1200))
lank4 = list(range(400, 1400))
lank3 = list(range(400, 1600))
lank2 = list(range(400, 1800))
lank1 = list(range(400, 2000))
if x in lank8:
print((8))
elif x in ... | x = int(eval(input()))
print((10 - x // 200)) | p02600 |
n=int(eval(input()))
if n<600:
print((8))
elif n<800:
print((7))
elif n<1000:
print((6))
elif n<1200:
print((5))
elif n<1400:
print((4))
elif n<1600:
print((3))
elif n<1800:
print((2))
else:
print((1))
| n=int(eval(input()))
print((abs(n-2199)//200)) | p02600 |
n=int(eval(input()))
print((abs(n-2199)//200)) | print((abs(int(eval(input()))-2199)//200)) | p02600 |
print((8-(int(eval(input()))-400)//200)) | x=int(eval(input()))
ans=8
x-=400
ans-=x//200
print(ans) | p02600 |
x = int(eval(input()))
if 400 <= x <= 599:
print('8')
elif 600 <= x <= 799:
print('7')
elif 800 <= x <= 999:
print('6')
elif 1000 <= x <= 1199:
print('5')
elif 1200 <= x <= 1399:
print('4')
elif 1400 <= x <= 1599:
print('3')
elif 1600 <= x <= 1799:
print('2')
else:
print('1') | print((10 - int(eval(input()))//200)) | p02600 |
# -*- coding: utf-8 -*-
def main():
import sys
input = sys.stdin.readline
x = int(eval(input()))
if x >= 1800:
print('1')
elif x >= 1600:
print('2')
elif x >= 1400:
print('3')
elif x >= 1200:
print('4')
elif x >= 1000:
print('... | # -*- coding: utf-8 -*-
def main():
import sys
input = sys.stdin.readline
x = int(eval(input()))
print((10 - x // 200))
if __name__ == '__main__':
main()
| p02600 |
n = int(eval(input()))
if 400 <=n <=599:
print((8))
elif 600 <=n <= 799:
print((7))
elif 800 <=n <=999:
print((6))
elif 1000 <=n<=1199:
print((5))
elif 1200 <=n <=1399:
print((4))
elif 1400<= n <=1599:
print((3))
elif 1600 <=n <=1799:
print((2))
elif 1800<= n <=1999:
pr... | a = 400
b = 199
L1= []
L2 = []
for i in range(8):
L1.append(a+200*(i))
L2.append(a+200*(i)+b)
n = int(eval(input()))
for i in range(8):
if L1[i] <= n <= L2[i]:
print((8-i)) | p02600 |
import sys
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
x = int(readline())
kyu = 0
if 400 <= x <= 599:
kyu = 8
if 600 <= x <= 799:
kyu = 7
if 800 <= x <= 999:
kyu = 6
if 1000 <= x <= 1... | x = int(eval(input()))
y = x // 200
print((10 - y)) | p02600 |
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd
from itertools import accumulate, permutations, combinations, product, groupby, combinations_with_replacement
from operator import itemgetter, mul
from copy import deepcopy
... | import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd
from itertools import accumulate, permutations, combinations, product, groupby, combinations_with_replacement
from operator import itemgetter, mul
from copy import deepcopy
... | p02600 |
x = int(eval(input()))
if 400 <= x < 600:
print((8))
elif 600 <= x < 800:
print((7))
elif 800 <= x < 1000:
print((6))
elif 600 <= x < 1200:
print((5))
elif 1200 <= x < 1400:
print((4))
elif 1400 <= x < 1600:
print((3))
elif 1600 <= x < 1800:
print((2))
elif 1800 <= x < 2000:... | x = int(eval(input()))
print((10 - x//200)) | p02600 |
# -*- coding: utf-8 -*-
# 標準入力を取得
X = int(eval(input()))
# 求解処理
ans = int()
if X <= 599:
ans = 8
elif X <= 799:
ans = 7
elif X <= 999:
ans = 6
elif X <= 1199:
ans = 5
elif X <= 1399:
ans = 4
elif X <= 1599:
ans = 3
elif X <= 1799:
ans = 2
elif X <= 1999:
ans = 1
... | # -*- coding: utf-8 -*-
def get_input() -> tuple:
"""
標準入力を取得する.
Returns:\n
tuple: 標準入力
"""
X = int(eval(input()))
return X
def main(X: int) -> None:
"""
メイン処理.
Args:\n
X (int): 最高レーティング（400 <= X <= 1999）
"""
# 求解処理
ans = 10 - (X ... | p02600 |
x = int(eval(input()))
if x >= 400 and x < 600:
print((8))
elif x >= 600 and x < 800:
print((7))
elif x >= 800 and x < 1000:
print((6))
elif x >= 1000 and x < 1200:
print((5))
elif x >= 1200 and x < 1400:
print((4))
elif x >= 1400 and x < 1600:
print((3))
elif x >= 1600 and x < 1800... | x = int(eval(input()))
a = x // 200
print(((8 - a) + 2))
| p02600 |
a = int(eval(input()))
if 400 <= a <= 599:
print((8))
elif 600 <= a <= 799:
print((7))
elif 800 <= a <= 999:
print((6))
elif 1000 <= a <= 1199:
print((5))
elif 1200 <= a <= 1399:
print((4))
elif 1400 <= a <= 1599:
print((3))
elif 1600 <= a <= 1799:
print((2))
elif 1800 <= a <=... | print((10 - int(eval(input())) // 200)) | p02600 |
x=int(eval(input()))
l=[[600,8],[800,7],[1000,6],[1200,5],[1400,4],[1600,3],[1800,2],[2000,1]]
for m in l:
if x<m[0]:
print((m[1]))
break | x=int(eval(input()))
for i in range(3,11):
if x<i*200:
print((11-i))
break | p02600 |
print((8 - (int(eval(input())) - 400) // 200))
| print((10 - int(eval(input())) // 200))
| p02600 |
X = int(eval(input()))
if X < 600:
print((8))
elif X < 800:
print((7))
elif X < 1000:
print((6))
elif X < 1200:
print((5))
elif X < 1400:
print((4))
elif X < 1600:
print((3))
elif X < 1800:
print((2))
else:
print((1)) | X = int(eval(input()))
ans = 8 - (X - 400)//200
print(ans) | p02600 |
X=int(eval(input()))
if X<600:
print((8))
elif X<800:
print((7))
elif X<1000:
print((6))
elif X<1200:
print((5))
elif X<1400:
print((4))
elif X<1600:
print((3))
elif X<1800:
print((2))
elif X<2000:
print((1)) | X=int(eval(input()))
print((10-X//200)) | p02600 |
a = int(eval(input()))
b = int(a//200)
if b == 2:
print((8))
elif b == 3:
print((7))
elif b== 4:
print((6))
elif b== 5:
print((5))
elif b==6:
print((4))
elif b==7:
print((3))
elif b==8:
print((2))
elif b==9:
print((1))
| a=int(eval(input()))
b=a//200
if b==2:
print((8))
elif b==3:
print((7))
elif b==4:
print((6))
elif b==5:
print((5))
elif b==6:
print((4))
elif b==7:
print((3))
elif b==8:
print((2))
elif b==9:
print((1)) | p02600 |
import sys,bisect,string,math,time,functools,random,fractions
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
from itertools import permutations,combinations,groupby
rep=range;R=range
def Golf():n,*t=map(int,open(0).read().split())
def I():return int(input())
def S_()... | print((10-int(eval(input()))//200)) | p02600 |
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1
x = int(eval(input()))
if x < 600:
print((8))
elif x < 800:
print((7))
elif x < 1000:
print((6))
eli... | x = int(eval(input()))
print((10 - x//200)) | p02600 |
X=int(eval(input()))
if 400<=X<=599:
print((8))
exit()
if 600<=X<=799:
print((7))
exit()
if 800<=X<=999:
print((6))
exit()
if 1000<=X<=1199:
print((5))
exit()
if 1200<=X<=1399:
print((4))
exit()
if 1400<=X<=1599:
print((3))
exit()
if 1600<=X<=1799:
... | X=int(eval(input()))
kyu= 10 - X//200
print(kyu) | p02600 |
rate = int(eval(input()))
k = '1'
if (400 <= rate < 600):
k = '8'
elif (600 <= rate < 800):
k = '7'
elif (800 <= rate < 1000):
k = '6'
elif (1000 <= rate < 1200):
k = '5'
elif (1200 <= rate < 1400):
k = '4'
elif (1400 <= rate < 1600):
k = '3'
elif (1600 <= rate < 1800):
k = '2... | def resolve():
rate = int(eval(input()))
if rate < 600:
print('8')
elif rate < 800:
print('7')
elif rate < 1000:
print('6')
elif rate < 1200:
print('5')
elif rate < 1400:
print('4')
elif rate < 1600:
print('3')
elif rate < 180... | p02600 |
# import sys
import math #sqrt,gcd,pi
# import decimal
# import queue # queue
# import bisect
# import heapq # priolity-queue
# import time
# from itertools import product,permutations,\
# combinations,combinations_with_replacement
# 重複あり順列、順列、組み合わせ、重複あり組み合わせ
# import collections # deque
# from operator ... | x = int(eval(input()))
if x<600:
print((8))
elif x<800:
print((7))
elif x<1000:
print((6))
elif x<1200:
print((5))
elif x<1400:
print((4))
elif x<1600:
print((3))
elif x<1800:
print((2))
else:
print((1)) | p02600 |
X = int(eval(input()))
if 1800 <= X <=1999:
print((1))
elif 1600 <= X <=1799:
print((2))
elif 1400 <= X <=1599:
print((3))
elif 1200 <= X <=1399:
print((4))
elif 1000 <= X <=1199:
print((5))
elif 800 <= X <=999:
print((6))
elif 600 <= X <=799:
print((7))
else:
print((8)... | X = int(eval(input()))
print((10 - X//200)) | p02600 |
x = int(eval(input()))
ans = 8
max = 599
min = 400
while True:
if min <= x < max:
print(ans)
break
else:
max += 200
min += 200
ans -= 1 | x = int(eval(input()))
ans = 8
max = 599
min = 400
while True:
if min <= x <= max:
print(ans)
break
else:
max += 200
min += 200
ans -= 1 | p02600 |
print(((2199-int(eval(input())))//200)) | import sys
readline = sys.stdin.readline
X = int(readline())
limit = 600
rank = 8
for i in range(8):
if X < limit:
print(rank)
break
limit += 200
rank -= 1 | p02600 |
def approve(A: list) -> bool:
is_even = lambda number: number % 2 is 0
is_odd = lambda number: not is_even(number)
is_dividable_by_3 = lambda number: number % 3 is 0
is_dividable_by_5 = lambda number: number % 5 is 0
is_dividable_by_3_or_5 = lambda number: is_dividable_by_3(number) or is_divida... | def approve(A: list) -> bool:
is_even = lambda number: number % 2 is 0
is_odd = lambda number: not is_even(number)
is_dividable_by_3 = lambda number: number % 3 is 0
is_dividable_by_5 = lambda number: number % 5 is 0
is_dividable_by_3_or_5 = lambda number: is_dividable_by_3(number) or is_divida... | p02772 |
n=int(eval(input()))
List=list(map(int,input().split()))
num=0
cnt=0
for i in List:
if i%2==0:
num+=1
if i%3==0 or i%5==0:
cnt+=1
if num==cnt:
print("APPROVED")
else:
print("DENIED") | import sys
n=int(eval(input()))
List=list(map(int,input().split()))
for i in range(len(List)):
if List[i]%2==0:
if List[i]%3!=0 and List[i]%5!=0:
print("DENIED")
sys.exit()
print("APPROVED") | p02772 |
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
for v in A:
if v % 2 == 0 and (v %3 != 0 and v % 5 != 0):
return "DENIED"
return "APPROVED"
if __name__ == '__main__':
print((main()))
| def main():
N = int(eval(input()))
A = list(map(int, input().split()))
for v in A:
if v % 2 == 0 and (v % 5 != 0 and v % 3 != 0): return "DENIED"
return "APPROVED"
if __name__ == '__main__':
print((main()))
| p02772 |
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
even = [v for v in A if v % 2 == 0]
if all((v % 3 == 0) or (v % 5 == 0) for v in even):
return "APPROVED"
return "DENIED"
if __name__ == '__main__':
print((main()))
| def main():
N = int(eval(input()))
A = list(map(int, input().split()))
for i in range(N):
if A[i] % 2 == 0 and (A[i] % 3 != 0 and A[i] % 5 != 0):
return "DENIED"
return "APPROVED"
if __name__ == '__main__':
print((main()))
| p02772 |
n = int(eval(input()))
L = list(map(int,input().split()))
L = [x for x in L if x%2 ==0]
if all((L[i]%3 == 0 or L[i]%5 == 0 for i in range(len(L)))):
print("APPROVED")
else:
print("DENIED") | n = int(eval(input()))
L = list(map(int,input().split()))
for i in range(n):
if L[i]%2 == 0:
if L[i]%3 == 0 or L[i]%5== 0:
continue
else:
print("DENIED")
exit()
print("APPROVED") | p02772 |
N = int(eval(input()))
A = list(map(int,input().split()))
B = list([x for x in A if x % 2 == 0])
C = list([(x % 5 == 0)or(x % 3 == 0) for x in B])
print((["APPROVED","DENIED"][False in C])) | eval(input())
print((["APPROVED","DENIED"]["1"in [format(0x28828228,'b')[int(x)%30-2] for x in input().split()]])) | p02772 |
n = int(eval(input()))
x = sum([1 for e in [int(a) for a in input().split(" ")] if not(e % 2 == 0 and e % 3 != 0 and e % 5 != 0)])
print(("APPROVED" if n == x else "DENIED")) | print(("APPROVED" if int(eval(input())) == sum([1 for e in [int(a) for a in input().split(" ")] if not(e % 2 == 0 and e % 3 != 0 and e % 5 != 0)]) else "DENIED")) | p02772 |
N = int(eval(input()))
A = list(map(int, input().split()))
ans = 'APPROVED'
for i in range(N):
if A[i] % 2 == 0:
if A[i] % 3 != 0 and A[i] % 5 != 0:
ans = 'DENIED'
break
print(ans) | N = int(eval(input()))
A = list(map(int, input().split()))
ans = 'APPROVED'
for i in range(N):
if A[i] % 2 == 0 and A[i] % 3 != 0 and A[i] % 5 != 0:
ans = 'DENIED'
break
print(ans) | p02772 |
n = int(eval(input()))
a = list(map(int, input().split()))
count = 0
x = [i for i in a if i % 2 == 0]
for i in x:
if i % 3 == 0 or i % 10 == 0:
count += 1
if len(x) == count:
print("APPROVED")
else:
print("DENIED")
| n = int(eval(input()))
a = [i for i in list(map(int, input().split())) if i % 2 == 0]
b = [i for i in a if i % 3 == 0 or i % 5 == 0]
if len(a) == len(b):
print("APPROVED")
else:
print("DENIED") | p02772 |
N = int(eval(input()))
A = list(map(int, input().split()))
even_num = []
for i in A:
if i % 2 == 0:
even_num.append(i)
for j in range(len(even_num)):
if even_num[j] % 3 != 0 and even_num[j] % 5 != 0:
print('DENIED')
exit()
print('APPROVED') | N = int(eval(input()))
A = list(map(int, input().split(' ')))
flag = True
for i in range(N):
if A[i] % 2 == 0:
if A[i] % 3 == 0 or A[i] % 5 == 0:
pass
else:
flag = False
if flag:
print("APPROVED")
else:
print("DENIED")
| p02772 |
def ng(n):
return n%2==0 and n%3!=0 and n%5!=0
n = eval(input())
print(('DENIED' if any(ng(int(i)) for i in input().split()) else 'APPROVED')) | def ng(n):
return not n%2 and n%3 and n%5
n = eval(input())
print(('DENIED' if any(ng(int(i)) for i in input().split()) else 'APPROVED')) | p02772 |
N=int(eval(input()))
A=list(map(int,input().split()))
for i in A:
if i%2==0:
if i%3!=0 and i%5!=0:
print("DENIED")
break
else:
print("APPROVED") | N=int(eval(input()))
A=list(map(int,input().split()))
print(("APPROVED" if all([i%2!=0 or i%3==0 or i%5==0 for i in A]) else "DENIED")) | p02772 |
N = int(eval(input()))
A = list(map(int, input().split()))
i = 0
for i in range(len(A)):
if (A[i] % 2 == 0):
if A[i] % 3 != 0 and A[i] % 5 != 0:
print('DENIED')
exit()
else:
continue
else:
continue
print('APPROVED') | N = int(eval(input()))
A = list(map(int, input().split()))
i = 0
for i in range(len(A)):
if (A[i] % 2 != 0 or (A[i] % 3 == 0 or A[i] % 5 == 0)):
continue
else:
print('DENIED')
exit()
print('APPROVED')
| p02772 |
n = int(eval(input()))
a = list(map(int, input().split()))
ans = "APPROVED"
for i in range(n):
if a[i] % 2 == 0:
if a[i] % 3 != 0 and a[i] % 5 != 0:
ans = "DENIED"
print(ans) | n = int(eval(input()))
a = list(map(int, input().split()))
ans = "APPROVED"
for i in range(n):
if a[i] % 2 == 0 and a[i] % 3 != 0 and a[i] % 5 != 0:
ans = "DENIED"
print(ans)
| p02772 |
from sys import exit
N = int(eval(input()))
A = tuple(map(int, input().split()))
for a in A:
if a % 2 == 0:
if not(a % 3 == 0 or a % 5 == 0):
print('DENIED')
exit()
print('APPROVED')
| from sys import exit
N = int(eval(input()))
A = tuple(map(int, input().split()))
for a in A:
if not a % 2 and a % 3 and a % 5:
print('DENIED')
exit()
print('APPROVED')
| p02772 |
n=int(eval(input()))
a=list(map(int,input().split()))
ans=True
for i in a:
if not i%2 and i%3 and i%5:
ans=False
break
print(('APPROVED' if ans else 'DENIED')) | n,*a=list(map(int,open(0).read().split()))
print(("DENIED" if sum((i%3)*(i%5) for i in a if i%2==0) else "APPROVED")) | p02772 |
def main():
_ = int(eval(input()))
a = list(map(int, input().split()))
odds = []
for i in a:
if i % 2 == 0:
odds.append(i)
for i in odds:
if i % 3 != 0 and i % 5 != 0:
print("DENIED")
return
print("APPROVED")
if __name__ == ... | def main():
_ = int(eval(input()))
a = list(map(int, input().split()))
odds = []
for i in a:
if i % 2 == 0:
odds.append(i)
for i in odds:
if i % 3 != 0 and i % 5 != 0:
print("DENIED")
return
print("APPROVED")
def main1():
... | p02772 |
N=eval(input())
A=list(map(int,input().split()))
print(("APPROVED" if all([a%2!=0 or a%3==0 or a%5==0 for a in A]) else "DENIED")) | N=eval(input())
A=list(map(int,input().split()))
print(("APPROVED" if all(a%2!=0 or a%3==0 or a%5==0 for a in A) else "DENIED")) | p02772 |
n=int(eval(input()))
a=list(map(int,input().split()))
for i in range(n):
if a[i]%2==0:
if a[i]%3==0 or a[i]%5==0:
pass
else:
print("DENIED")
break
else:
print("APPROVED") | n=int(eval(input()))
a=list(map(int,input().split()))
p=[]
for i in range(n):
p.append(1)
z=0
for i in range(n):
if a[i]%2==1:
p[i]=0
else:
if a[i]%6==0:
p[i]=0
elif a[i]%10==0:
p[i]=0
z=z+p[i]
if z==0:
print("APPROVED")
else:
... | p02772 |
N = int(eval(input()))
li = list(map(int,input().split()))
even_li = [x for x in li if x%2 == 0]
ap = 0
for i in even_li:
if i % 3 == 0 or i % 5 == 0:
ap += 1
if even_li == []:
print("APPROVED")
elif ap == len(even_li):
print("APPROVED")
else:
print("DENIED") | N = int(eval(input()))
li = list(map(int,input().split()))
app = 0
for i in li:
if i % 2 == 0 and (i % 6 == 0 or i % 10 == 0):
pass
elif i % 2 == 0:
app += 1
break
if app == 0:
print("APPROVED")
else:
print("DENIED") | p02772 |
n = int(eval(input()))
a = list(map(int, input().split()))
for i in range(n):
if a[i] % 2 == 0:
if a[i] % 3 != 0 and a[i] % 5 != 0:
print('DENIED')
exit()
print('APPROVED')
| n = int(eval(input()))
a = list(map(int, input().split()))
for i in range(n):
if a[i] % 2 == 0:
if a[i] % 3 == 0 or a[i] % 5 == 0:
continue
else:
print('DENIED')
exit(0)
print('APPROVED') | p02772 |
N = int(eval(input()))
a = list(map(int, input().split()))
el = []
for i in a:
if i % 2 == 0:
el.append(i)
for i in range(len(el)):
if el[i] % 3 == 0 or el[i] % 5 == 0:
el[i] = True
else:
el[i] = False
if el.count(False):
print("DENIED")
else:
print("APPROV... | N = int(input())
a = list(map(int, input().split()))
aeve = map(lambda x: x if x % 2 == 0 else 0, a)
ad35 = map(lambda x: True if x % 3 == 0 or x % 5 == 0 else False, aeve)
print("APPROVED") if all(ad35) else print("DENIED")
| p02772 |
N = int(eval(input()))
A = list(map(int, input().split()))
for a in A:
if a % 2 == 1:
continue
if a % 3 == 0 or a % 5 == 0:
continue
print("DENIED")
exit()
print("APPROVED")
| N = int(eval(input()))
A = list(map(int, input().split()))
for a in A:
if a % 2 == 1:
continue
if a % 3 == 0:
continue
if a % 5 == 0:
continue
print("DENIED")
exit()
print("APPROVED") | p02772 |
N = int(eval(input()))#.split()
A = input().split()
den = False
for i in range(N):
if int(A[i]) % 2 == 0:
if int(A[i]) % 3 != 0 and int(A[i]) % 5 != 0:
print("DENIED")
exit(0)
den = True
if not den:
print("APPROVED")
| N = int(eval(input()))
A = input().split()
for i in range(N):
if int(A[i])%2==0:
if int(A[i])%3!=0 and int(A[i])%5!=0:
print("DENIED")
exit(0)
print("APPROVED")
| p02772 |
def main():
N = int(eval(input()))
A = list(map(int,input().split()))
answer = "APPROVED"
for a in A:
if a % 2 == 0:
if a % 3 == 0 or a % 5 == 0:
pass
else:
answer = "DENIED"
else:
pass
print(answer)
i... | def main():
N = int(eval(input()))
A = list(map(int,input().split()))
answer = "APPROVED"
for a in A:
if a % 2 == 0:
if a % 3 == 0 or a % 5 == 0:
continue
else:
answer = "DENIED"
print(answer)
if __name__ == "__main__":
... | p02772 |
stdin = open(0).read().split('\n')
N=int(stdin[0])
A=list(map(int,stdin[1].split()))
flag=True
for a in A:
if a%2==0 and a%3!=0 and a%5!=0:flag=False
print(('APPROVED' if flag else 'DENIED')) | stdin = open(0).read().split('\n')
N=int(stdin[0])
A=list(map(int,stdin[1].split()))
flag=True
for a in A:
if a%2==0 and a%3!=0 and a%5!=0:
flag=False
break
print(('APPROVED' if flag else 'DENIED')) | p02772 |
N = int(eval(input()))
A = list(map(int,input().split()))
X = 0
Y = 0
for i in range(0,N):
if A[i] % 2 == 0:
X += 1
if ((A[i] / 2) % 3 == 0) or ((A[i] / 2) % 5 == 0):
Y += 1
if X == Y:
print('APPROVED')
else:
print('DENIED') | B = int(eval(input()))
N = list(map(int,input().split()))
A = 'APPROVED'
for i in range(len(N)):
if N[i] %2 ==0 :
if N[i] % 3 != 0 and N[i] % 5 != 0:
A = 'DENIED'
break
else:
continue
print(A) | p02772 |
def main():
X = int(eval(input()))
# A = list(map(int, input().split()))
A = input().split()
b = []
for ai in A:
b.append(ai)
b = b[::-1]
# print(b)
print((" ".join(b)))
if __name__ == "__main__":
main() | def main():
N = int(eval(input()))
# A = list(map(int, input().split()))
A = input().split()
# b = []
# for ai in A:
# b.append(ai)
# b = b[::-1]
# # print(b)
# print(" ".join(b))
b = []
for i in range(N - 1, -1, -2):
b.append(A[i])
... | p03673 |
from collections import deque
n,a,b=int(input()),deque(map(int,input().split())),deque()
for i in range(n):
if n%2==0:
if i%2==0:
b.append(a[i])
else:
b.appendleft(a[i])
else:
if i%2==0:
b.appendleft(a[i])
else:
b.append(a[i])
print(*b,sep=' ')
| n,a=int(input()),list(map(int,input().split()))
b=[a[1::2][::-1]+a[::2],a[0::2][::-1]+a[1::2]][n%2]
print(*b,sep=' ')
| p03673 |
n,a=int(input()),list(map(int,input().split()))
b=[a[1::2][::-1]+a[::2],a[0::2][::-1]+a[1::2]][n%2]
print(*b,sep=' ')
| n,a=int(input()),list(map(int,input().split()))
print(*[a[1::2][::-1]+a[::2],a[0::2][::-1]+a[1::2]][n%2],sep=' ')
| p03673 |
n = int(eval(input()))
a = list(map(int,input().rstrip().split(" ")))
b1 = []
b2 = []
ans = []
if n % 2 == 0:
for i in range(n):
if n % 2 == 0:
b1.append(a[i])
else:
b2.append(a[i])
b1.reverse()
ans = b1 + b2
print((" ".join(str(i) for i in an... | n = int(eval(input()))
a = list(map(int,input().rstrip().split(" ")))
b1 = []
b2 = []
ans = []
if n % 2 == 0:
for i in range(n):
if i % 2 == 0:
b1.append(a[i])
else:
b2.append(a[i])
b2.reverse()
ans = b2 + b1
print((" ".join(str(i) for i in ans)))
el... | p03673 |
n = int(input())
L = [None]+list(input().split())
even = []
odd = []
if n % 2 == 0:
for i in range(1,1+n):
if i % 2 == 0:
even.append(L[i])
else:
odd.append(L[i])
for j in range(len(even[::-1])):
if j == len(even) - 1:
print(even[::-1][j],e... | n = int(input())
L = [None]+list(input().split())
even = []
odd = []
if n % 2 == 0:
for i in range(1,1+n):
if i % 2 == 0:
even.append(L[i])
else:
odd.append(L[i])
ans = even[::-1] + odd
else:
for i in range(1,1+n):
if i % 2 == 0:
even... | p03673 |
def main():
length = int(eval(input()))
numbers = list(map(int, input().split()))
answer = []
for num in numbers:
answer.append(num)
answer = list(reversed(answer))
print((" ".join(map(str, answer))))
if __name__ == '__main__':
main()
| def main():
length = int(eval(input()))
numbers = list(map(int, input().split()))
answer = [0] * length
if length % 2:
answer[:length // 2 + 1] = numbers[::-2]
answer[length // 2 + 1:] = numbers[1::2]
else:
answer[:length // 2] = numbers[::-2]
answer[length /... | p03673 |
N=int(input())
A=list(map(int,input().split()))
ans=[]
for i in range(N):
if N%2==0:
if i%2==0:
ans.append(A[i])
else:
ans.insert(0,A[i])
else:
if i%2==0:
ans.insert(0,A[i])... | N=int(input())
A=list(map(int,input().split()))
ans=[0 for i in range(N)]
c=0
d=0
for i in range(N):
if N%2==0:
if i%2==0:
ans[N//2+c]=A[i]
c+=1
else:
ans[N//2-1-d]=A[i]
d+... | p03673 |
n=int(eval(input()))
a=list(map(str,input().split()))
b=[]
for i in range(n):
b.append(a[i])
b.reverse()
print((" ".join(b)))
| n=int(eval(input()))
a=list(map(str,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])
c.reverse()
else:
for i in range(n):
if i%2==1:
b.append(a[i])
else:
c.a... | p03673 |
n = int(input())
a = list(map(int,input().split()))
ans = []
for i in a:
ans = ans + [i]
ans = ans[::-1]
print(*ans,sep=" ")
| n = int(input())
a = list(map(int,input().split()))
if n % 2 == 0:
a = a[::-2]+a[0::2]
else: a = a[::-2] +a[1::2]
print(*a,sep=" ")
| p03673 |
n = int(input())
num_list = list(map(int, input().split()))
b = []
for a in num_list:
b.append(a)
b = [i for i in (reversed(b))]
for i in range(len(b)):
if i != len(b)-1:
print(b[i],end="")
print(" ", end="")
else:
print(b[i])
| n = int(input())
a_list = list(map(int, input().split()))
a1_list = []
a2_list = []
n_list = [0]*n
if n % 2 == 0:
for i in range(n):
if i % 2 == 0:
a1_list.append(a_list[i])
else:
a2_list.append(a_list[i])
for i in reversed(a2_list):
print(i, end="")
... | 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(str,input().split()))
b = []
for i in range(n-1-(1-(n-1)%2),0,-2):
b.append(a[i])
for i in range(0,n-1-(n-1)%2+1,2):
b.append(a[i])
if n%2 == 1:
b = b[::-1]
print((" ".join(b))) | p03673 |
#ABC066C
n=int(eval(input()))
a=list(map(int, input().split()))
front=[]
back=[]
flg=n%2
for i in range(n//2):
front.insert(0, a[2*i-flg+1])
#back.append(a[2*i+flg])
back=[a[2*i+flg] for i in range(n//2)]
if flg==1:
front.insert(0, a[n-1])
print((' '.join(map(str, front+back))))
| #ABC066C
n=int(eval(input()))
a=list(map(int, input().split()))
flg=n%2
half=n//2
front=[0]*(half+flg)
back=[0]*(half)
for i in range(half):
front[half+flg-1-i]=a[2*i-flg+1]
back[i]=a[2*i+flg]
if flg==1:
front[0]=a[n-1]
print((' '.join(map(str, front+back))))
| p03673 |
n = int(eval(input()))
a = list(map(int, input().split()))
b = []
for ai in a:
b.append(str(ai))
b = list(reversed(b))
print((' '.join(b))) | n = int(eval(input()))
a = list(map(int, input().split()))
#b = []
#for ai in a:
# b.append(str(ai))
# b = list(reversed(b))
#print(' '.join(b))
if len(a) % 2 == 0:
even = []
odd = []
for i, ai in enumerate(a):
if (i + 1) % 2 == 0:
even.append(str(ai))
else:
odd.append(str(ai))... | p03673 |
n = int(eval(input()))
a = [int(i) for i in input().split()]
b = []
for i in a:
b.append(i)
b = list(reversed(b))
b = [str(b_) for b_ in b]
ans = " ".join(b)
print(ans) | n = int(eval(input()))
a = [int(i) for i in input().split()]
e = [a[i] for i in range(n) if i % 2 == 1]
o = [a[i] for i in range(n) if i % 2 == 0]
if (n % 2 == 1):
ans = o[::-1] + e
else:
ans = e[::-1] + o
ans = [str(i) for i in ans]
ans = " ".join(ans)
print(ans) | p03673 |
# coding: utf-8
n=int(eval(input()))
A=list(map(int,input().split()))
b=[]
for i in range(n):
if i%2==0:
b.append("{}".format(A[i]))
else:
b.insert(0,"{}".format(A[i]))
if n%2==1:
b.reverse()
print((" ".join(b)))
else:
print((" ".join(b)))
| # coding: utf-8
n=int(eval(input()))
A=list(map(int,input().split()))
l=[]
r=[]
k=1
for i in range(n):
if i%2==0:
r.append("{}".format(A[i]))
else:
l.append("{}".format(A[i]))
l.reverse()
b=l+r
if n%2==1:
b.reverse()
print((" ".join(b)))
| p03673 |
n = int(eval(input()))
a = list(map(int,input().split()))
b = []
for i in range(n):
b.append(str(a[i]))
b.reverse()
print((" ".join(b))) | n = int(eval(input()))
a = list(map(int,input().split()))
left = []
right = []
for i in range(n):
right.append(str(a[i]))
left,right = right,left
left.reverse()
print((" ".join(left+right))) | p03673 |
N = int(eval(input()))
l = list(map(int, input().split()))
ans = []
if N % 2 == 0:
flag = 0
else:
flag = 1
for ix,i in enumerate(l):
if ix % 2 == flag:
ans.append(i)
else:
ans.insert(0, i)
print((" ".join(map(str, ans)))) | n = int(eval(input()))
a = list(map(str,input().split()))
b = a[::-1]
b = b[::2]
if n%2 == 0:
c = a[::2]
else:
c = a[1::2]
d = b+c
if n >= 2:
print((' '.join(d)))
else:
print((a[0])) | 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 = []
for i in range((n+1)//2):
here = n-1-2*i
b.append(str(a[here]))
for i in range(n//2):
here = 2*i+(n%2)
b.append(str(a[here]))
print((' '.join(b))) | p03673 |
n = int(eval(input()))
a = input().split()
b = []
if n % 2:
flg = False
else:
flg = True
for v in a:
if flg:
b.append(v)
flg = False
else:
b.insert(0,v)
flg = True
print((' '.join(b))) | n = int(eval(input()))
a = input().split()
reb_a = a[::-1]
if n % 2 == 0:
res = reb_a[::2]+a[::2]
else:
res = reb_a[::2]+a[1::2]
print((' '.join(res))) | p03673 |
n=int(eval(input()))
a=list(map(int,input().split()))
b=[]
for i in range(n):
b.append(a[i])
b.reverse()
map_b=list(map(str,b))
v=" ".join(map_b)
print(v) | n=int(eval(input()))
a=list(map(int,input().split()))
a.reverse()
ans=[]
re_ans=[]
if n==1:
print((a[0]))
else:
ans=a[::2]
re_ans=a[1::2]
re_ans.reverse()
ans.extend(re_ans)
map_ans=list(map(str,ans))
v=" ".join(map_ans)
print(v) | p03673 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.