NYOJ_714_Card Trick【队列】

最新推荐文章于 2018-03-09 20:59:17 发布

持之以恒_fighting

最新推荐文章于 2018-03-09 20:59:17 发布

阅读量441

点赞数 1

分类专栏：河南第六届省赛

本文链接：https://blog.youkuaiyun.com/huangshuai147/article/details/70225858

版权

河南第六届省赛专栏收录该内容

5 篇文章

订阅专栏

本文介绍了一种通过算法实现特定魔术效果的方法，即通过预先安排扑克牌的顺序，使魔术师能够按照预定的顺序逐一展示从A到N的梅花牌。文章提供了完整的C++代码示例，展示了如何通过队列操作实现这一过程。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

/*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…
样例输入

    2
    4
    5

样例输出

    2 1 4 3
    3 1 4 5 2

题意：抽取上面第一张牌后放到最后，然后现在上面显现的是（梅花）A，然后去掉A，然后再抽取两张放到后面，现在上面的牌显示（梅花） 2 ，然后去掉2 ，依次，，，知道第n次。。

#include <cstdio>
#include <cstring>
#include <queue>
using namespace std;
queue<int> Q;
int s[30];
int main()
{
	int T;
	scanf("%d",&T);
	while(T--)
	{
		int n;
		int 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 t = Q.front();
				Q.pop();
				
				Q.push(t);
			}
			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;
}