Card Trick
时间限制:
1000 ms | 内存限制:
65535 KB
难度:
3
-
描述
-
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.
-
输入
- 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… 样例输入
-
245
样例输出
-
2 1 4 33 1 4 5 2
来源
- 第六届河南省程序设计大赛
//抽取上面第一张牌后放到最后,然后现在上面显现的是(梅花)A,然后去掉A,然后再抽取两张放到后面,
//现在上面的牌显示(梅花)2 ,然后去掉2 ,依次,,,直到n次 。。
#include<stdio.h>
#include<cstring>
#include<queue>
using namespace std;
queue<int> Q;
int s[30];
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
int n,i,j,k=1;
int index=0;
scanf("%d",&n);
for(i=1;i<=n;i++)//初始化牌
Q.push(i);
for(i=1;i<=n;i++)
{
j=i;
while(j--)//队列 弹出次数 1、2、3、...n 第一次弹出来一个第二次弹出来两个
{
int temp=Q.front();
Q.pop();
Q.push(temp);
}
index=Q.front();//队首 弹出 index指的是位置1、2、3、、、n,不是具体的数字
Q.pop();
s[index]=k++;
}
for(i=1;i<=n;i++)
printf("%d ",s[i]);
printf("\n");
}
return 0;
}