卡牌伎俩（Card Trick）

最新推荐文章于 2018-04-20 11:07:20 发布

原创最新推荐文章于 2018-04-20 11:07:20 发布 · 914 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#算法设计与分析

算法尝试专栏收录该内容

4 篇文章

订阅专栏

本文介绍了一种通过编程解决魔术师卡片排列问题的方法。魔术师需要按特定顺序排列卡片，以便在表演过程中依次展示从A到N的梅花牌。文章包含了一个C语言实现的示例程序，用于计算出给定数量的卡片时正确的初始排列。

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

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

暴力解题，毫无技巧性。

#include<stdio.h>

int main() {
    int i, j;
    int n=0;
    scanf("%d",&n);
    int m = 0;
    while (n--){
        scanf("%d",&m);
        int k[14] = { 0 };
        int t=1;
        int tt = t+1;
        while (true){
            for (i = 1; i <= m; i++) {
                if(k[i]==0)
                    tt--;
                if (tt == 0) {
                    k[i] = t;
                    t++;
                    tt = t+1;
                }

            }
            if (t > m) {
                for (j = 1; j <= m; j++)
                    printf("%d ",k[j]);
                break;
            }
        }
        printf("\n");
    }
}