思路:
一直乘2其实就是x向x*2%n连边。这个过程可能会成环,如果出现重复再乘3,那就到了另一个环了。所以可以一直乘2,到了标记的点再乘3。
#include <iostream>
#include <string.h>
#include <algorithm>
#include <stdio.h>
#include <math.h>
#include <vector>
using namespace std;
typedef unsigned int uint;
const int maxn = 1e6 + 7;
int n;
int a[maxn],vis[maxn];
bool judge() { //判断是是否是排列
for(int i = 1;i <= n;i++) vis[i] = 0;
for(int i = 1;i <= n;i++) {
if(vis[a[i]] || a[i] > n || a[i] < 1) return false;
vis[a[i]] = 1;
}
return true;
}
bool check() {
for(int i = 1;i <= n - 1;i++) {
int num1 = a[i] * 2,num2 = a[i] * 3;
if((num1 % (n + 1) != a[i + 1]) && (num2 % (n + 1) != a[i + 1])) {
return false;
}
}
return true;
}
int main() {
int T;scanf("%d",&T);
while(T--) {
scanf("%d",&n);
n--;
a[1] = 1;
for(int i = 1;i <= n;i++) vis[i] = 0;
vis[1] = 1;
for(int i = 2;i <= n;i++) {
int num = a[i - 1] * 2 % (n + 1);
if(vis[num]) {
a[i] = a[i - 1] * 3 % (n + 1);
} else {
a[i] = a[i - 1] * 2 % (n + 1);
}
vis[a[i]] = 1;
}
if(!judge()) {
for(int i = 1;i <= n;i++) vis[i] = 0;
vis[1] = 1;
for(int i = 2;i <= n;i++) {
int num = a[i - 1] * 3 % (n + 1);
if(vis[num]) {
a[i] = a[i - 1] * 2 % (n + 1);
} else {
a[i] = a[i - 1] * 3 % (n + 1);
}
vis[a[i]] = 1;
}
}
if(!judge()) {
printf("-1\n");
} else {
if(check()) {
for(int i = 1;i <= n;i++) {
printf("%d ",a[i]);
}
printf("\n");
} else {
printf("-1\n");
}
}
}
return 0;
}