URAL/1535

来自"NOCOW"

规律题，写个搜索认真观察就行～

#include <cstdio>
int n,i,j,t,a[25001];
int main()
{
    scanf("%d",&n);
    if (n&1)
    {
        printf("1");
        for (i=3,j=n-1;i<=n;i+=2,j-=2)
            printf(" %d %d",j,i);
        printf("\n");
    }
    else
    {
        for (i=1,j=n-1;i<j;i+=2,j-=2)
            printf("%d %d ",i,j);
        if (i == j)  printf("%d ",i);
        for (t=(n>>1),i=2,j=n;i<j;i+=2,j-=2)
        {
            a[t--]=j;
            a[t--]=i;
        }
        if (i == j)  printf("%d ",i);
        for (++t;t<=(n>>1);++t)  printf("%d ",a[t]);
        printf("\n");
    }
    printf("1");
    for (i=2;i<=n;i+=2)  printf(" %d",i);
    for (i=n-(n&1^1);i>1;i-=2)  printf(" %d",i);
    printf("\n");
    return 0;
}
//by zzy