VJ——A. Perfect Permutation CodeForces - 233A

759丶Judges

于 2018-08-22 17:10:41 发布

阅读量258

点赞数

分类专栏： SDUT 文章标签： SDUT-VJ 水题

本文链接：https://blog.csdn.net/qq_42847312/article/details/81947550

版权

博客介绍了如何解决CodeForces中的一道题目——Perfect Permutation（233A）。题目要求构造一个完美排列，即对于任何位置i，排列中的pi值等于i但位置不相同。当n为奇数时，不存在完美排列；当n为偶数时，可以将偶数位置的数字与奇数位置的数字交换来构造完美排列。博客给出了一个示例输入输出及AC（Accepted）代码。

摘要由CSDN通过智能技术生成

A. Perfect Permutation

A permutation is a sequence of integers p1, p2, …, pn, consisting of n distinct positive integers, each of them doesn’t exceed n. Let’s denote the i-th element of permutation p as pi. We’ll call number n the size of permutation p1, p2, …, pn.

Nickolas adores permutations. He likes some permutations more than the others. He calls such permutations perfect. A perfect permutation is such permutation p that for any i (1 ≤ i ≤ n) (n is the permutation size) the following equations hold ppi = i and pi ≠ i. Nickolas asks you to print any perfect permutation of size n for the given n.

Input
A single line contains a single integer n (1 ≤ n ≤ 100) — the permutation size.

Output
If a perfect permutation of size n doesn’t exist, print a single integer -1. Otherwise print n distinct integers from 1 to n, p1, p2, …, pn — permutation p, that is perfect. Separate printed numbers