给出n,要求用1~n组成一个序列,并且p[i] % | p[i]-p[i-2] | = 0
那么只要p[i]-p[i-2]都等于1就可以满足条件了,也很容易做到
把1~n从中分成两段,然后分割插入进去,比如n=8:1,5,2,6,3,7,4,8
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<stack>
using namespace std;
typedef long long ll;
const int N=1e5+10;
int main()
{
int T,n;
while(~scanf("%d",&T))
while(T--)
{
scanf("%d",&n);
int l=n/2+1,r=2;
if(n%2) l++;
printf("1");
int p=1;
while(p<n)
{
if(p%2) printf(" %d",l++);
else printf(" %d",r++);
p++;
}
printf("\n");
}
return 0;
}