Card Trick（模拟）

Card Trick

题目描述

The magician shuffles a small pack of cards, holds it face down and performs the following procedure:
1. 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.
2. 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.
3. Three cards are moved one at a time…
4. 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.

输入

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

输出

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…

样例输入

2
4
5

样例输出

2 1 4 3
3 1 4 5 2

题意描述：

一个人手中有n张扑克牌，然后呢把第一张放到后面，把第二张（也就是当前第一张）放到桌子上，然后把前两张逐个放到后面，把第三张（也就是当前的第一张）放到桌子上，再然后把前三张逐个放到后面，把第四张（也就是当前的第一张）放到桌子上，以此类推，当手中没有扑克牌的时候，桌子上的扑克牌的顺序是1到n，问手中扑克牌最初的顺序

程序代码：

#include<stdio.h>
int main()
{
	int n,i,j,k,t,T;
	int a[15];
	scanf("%d",&T);
	while(T--)
	{
		scanf("%d",&n);
		for(i=n;i>0;i--)
		{
			a[i]=i;
			for(j=1;j<=i;j++)
			{
				t=a[n];
				for(k=n;k>i;k--)
					a[k]=a[k-1];
				a[i]=t;
			}
		}
		for(i=1;i<=n;i++)
			printf("%d ",a[i]);
		printf("\n");
	}
	return 0;
}

程序代码