Summer Individual - 17 -A

最新推荐文章于 2023-12-22 02:23:09 发布

ID_BePosit

最新推荐文章于 2023-12-22 02:23:09 发布

阅读量212

点赞数

分类专栏： CodeForces

本文链接：https://blog.csdn.net/BePosit/article/details/81335462

版权

CodeForces 专栏收录该内容

33 篇文章 0 订阅

订阅专栏

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.

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n;
    cin>>n;
    if(n%2==0)
    {
        for(int i=1; i<=n; i++)
        {
            if(i==1)
                cout<<i+1;
            else if(i%2)
                cout<<" "<<i+1;
            else
                cout<<" "<<i-1;
        }
    }
    else
        cout<<-1<<endl;
    return 0;
}