Codeforces 303A Lucky Permutation Triple【思维】

最新推荐文章于 2022-03-23 21:31:48 发布

mengxiang000000

最新推荐文章于 2022-03-23 21:31:48 发布

阅读量708

点赞数

分类专栏：思维文章标签： Codeforces 303A

本文链接：https://blog.csdn.net/mengxiang000000/article/details/53046939

版权

思维专栏收录该内容

692 篇文章 0 订阅

订阅专栏

Bike is interested in permutations. A permutation of length n is an integer sequence such that each integer from 0 to (n - 1) appears exactly once in it. For example, [0, 2, 1] is a permutation of length 3 while both [0, 2, 2] and [1, 2, 3] is not.

A permutation triple of permutations of length n (a, b, c) is called a Lucky Permutation Triple if and only if $\text{[math]}$ . The sign a_i denotes the i-th element of permutation a. The modular equality described above denotes that the remainders after dividing a_i + b_i by n and dividing c_i by n are equal.

Now, he has an integer n and wants to find a Lucky Permutation Triple. Could you please help him?

Input

The first line contains a single integer n (1 ≤ n ≤ 10⁵).

Output

If no Lucky Permutation Triple of length n exists print -1.

Otherwise, you need to print three lines. Each line contains n space-seperated integers. The first line must contain permutation a, the second line — permutation b, the third — permutation c.

If there are multiple solutions, print any of them.

Examples

Input

Output

1 4 3 2 0
1 0 2 4 3
2 4 0 1 3

Input

Output

-1

Note

In Sample 1, the permutation triple ([1, 4, 3, 2, 0], [1, 0, 2, 4, 3], [2, 4, 0, 1, 3]) is Lucky Permutation Triple, as following holds:

$\text{[math]}$ ;
$\text{[math]}$ ;
$\text{[math]}$ ;
$\text{[math]}$ ;
$\text{[math]}$ .

In Sample 2, you can easily notice that no lucky permutation triple exists.

题目大意：

给你一个序列长度N，让你找合法的三个集合，使得集合A和集合B对应位子相加和对应位子集合C中的数同余。

如果存在解，输出任意一个，否则输出-1.

思路：

1、暴力代码跑了一波，发现N是奇数的无解。

那么如果N是奇数，直接输出-1即可。

2、那么如果N是偶数，我们直接将数值相加岔开即可。

即：

if（n==5）

0+1=1

1+2=3

2+3=0

3+4=2

4+0=4

即我们让0+1,1+2,2+3,3+4,4+5...................n-1+0即可。

Ac代码：

#include<stdio.h>
#include<string.h>
using namespace std;
int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        if(n%2==0)
        {
            printf("-1\n");
            continue;
        }
        for(int i=0;i<n;i++)
        {
            printf("%d ",i);
        }
        printf("\n");
        for(int i=1;i<n+1;i++)
        {
            printf("%d ",i%n);
        }
        printf("\n");
        for(int i=0;i<n;i++)
        {
            printf("%d ",(i+(i+1)%n)%n);
        }
        printf("\n");
    }
}