poj3032类似约瑟夫环（用数组做，模拟完可以知道初始位置）

Card Trick
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 3224 Accepted: 2354
Description

The magician shuffles a small pack of cards, holds it face down and performs the following procedure:

The top card is moved to the bottom of the pack. The new top card is dealt face up onto the table. It is the Ace of Spades.
Two cards are moved one at a time from the top to the bottom. The next card is dealt face up onto the table. It is the Two of Spades.
Three cards are moved one at a time…
This goes on until the nth and last card turns out to be the n of Spades.
This impressive trick works if the magician knows how to arrange the cards beforehand (and knows how to give a false shuffle). Your program has to determine the initial order of the cards for a given number of cards, 1 ≤ n ≤ 13.

Input

On the first line of the input is a single positive integer, telling the number of test cases to follow. Each case consists of one line containing the integer n.

Output

For each test case, output a line with the correct permutation of the values 1 to n, space separated. The first number showing the top card of the pack, etc…

Sample Input

2
4
5
Sample Output

2 1 4 3
3 1 4 5 2
Source

Nordic 2006

题意：给你n张牌，让你变一个魔术：第1次把上面的1张牌放到底部，然后最上面的牌就是1，然后拿走1。第2次把上面的2张牌依次放到底部，然后最上面的牌就是2，然后拿走2….重复这个过程，直到所有的牌都被拿走。问一开始的牌应该从上到下怎么放，才能完成这个魔术。

类似约瑟夫环，直接模拟。不过用链表不太容易求出顺序，用数组模拟链表，一开始下标顺序就是牌的顺序

#include <stdio.h>
#include <stdlib.h>

int n;
int left[20];
int right[20];
int data[20];

void init()
{
    int i;
    left[1] = n;
    for (i = 2; i <= n; i++) left[i] = i - 1;
    right[n] = 1;
    for (i = 1; i < n; i++) right[i] = i + 1;
}

void Connect(int X, int Y)
{
    right[X] = Y;
    left[Y] = X;
}

int main(void)
{
    int T, cur, i, j, t;

    scanf("%d", &T);
    while (T--)
    {
        scanf("%d", &n);
        init();
        cur = 1;
        for (i = 1; i <= n; i++)
        {
            for (j = 0; j < i; j++) cur = right[cur];
            data[cur] = i;
            t = cur;
            cur = right[cur];
            Connect(left[t], right[t]);
        }

        printf("%d", data[1]);
        for (i = 2; i <= n; i++) printf(" %d", data[i]);
        printf("\n");
    }
    return 0;
}