寻找一个 $1 \dots n$ 的排列，使得 $\prod_{i=1}^{n} \text{lcm}(p_i, p_{(i \bmod n) + 1})$ 最大。
输入格式
一个整数 $n$，满足 $n \le 10^5$。
输出格式
输出 $n$ 个整数，即为答案。
样例
样例输入 1
3
样例输出 1
1 2 3
样例输入 2
7
样例输出 2
1 2 3 4 5 6 7
QOJ.ac
QOJ
Time Limit: 1 s
Memory Limit: 256 MB
Total points: 100
#6747. 排列
Statistics
The problem was used in the following contests:
AI Translation —
This statement was translated using AI and may contain inaccuracies. Please refer to the original statement if in doubt.
Discussions
About Discussions
The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.
This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.
Open Discussions 0
No discussions in this category.
Issues
About Issues
If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.
Guidelines:
- This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
- Do not submit duplicated issues.
- Issues must be filed in English or Chinese only.
Active Issues 0
No issues in this category.
Closed/Resolved Issues 0
No issues in this category.