Beautiful Permutation II

CSESAdditional Problems IOpen on judge ↗

A permutation of integers 1,2,\ldots,n is called beautiful if there are no adjacent elements whose difference is 1. Given n, construct the lexicographically minimal beautiful permutation if such a permutation exists. Input The only line contains an integer n. Output Print the lexicographically minimal beautiful permutation of integers 1,2,\ldots,n. If there is no such permutation, print "NO S

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI