← Back to List

30618번: donstructive ↗

Solutions

Python 3
731 B | 731 chars
import sys
from math import sqrt, pi, sin, factorial, ceil, floor
from datetime import datetime, timedelta
# sys.setrecursionlimit(10**7)

BLANK = " "

# inp = input
inp = lambda : sys.stdin.readline().rstrip()
mii = lambda x = BLANK : [*map(int,inp().split(x))]
mfi = lambda x = BLANK : [*map(float,inp().split(x))]
ii = lambda : int(inp())
fi = lambda : float(inp())
p = print
def gcd(a, b): return gcd(b, a % b) if b > 0 else a
def lcm(a, b): return a * b // gcd(a, b)


def solve():
	n = ii()

	left = []
	right = []

	for i in range(1, n + 1):
		if i % 2 == 1:
			left.append(i)
		else:
			right.append(i)
	right = right[::-1]

	p(*(left + right))

if __name__ == "__main__":
	tc = 1
	for t in range(1, tc+1):
		ret = solve()