zoukankan      html  css  js  c++  java
  • 河南省第六届大学生程序设计竞赛 : Card Trick(模拟)

    http://acm.zzuli.edu.cn/problem.php?id=1486

    题目描述

    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…

    样例输入 Copy

    2
    4
    5

    样例输出 Copy

    2 1 4 3
    3 1 4 5 2

    题意分析:

    一副扑克牌,要拿一张放在末尾,第一张牌是1,把1拿走,

    再拿出两张牌放在末尾,第一张牌是2,把2拿走,

    再拿出三张牌放在末尾,第一张牌是3,把3拿走,

    ..................

    以此类推,问最开始牌的顺序是什么。

    解题思路:

    反着来想,第一张牌是n,从末尾拿出n张牌放在上面,

    现在第一张牌是n-1,从末尾拿出n-1张牌放在上面,

    ................

    以此类推。

    #include <stdio.h>
    #include <string.h>
    #define N 1020
    int a[N];
    int main()
    {
    	int T,n,i,m,j;
    	scanf("%d", &T);
    	while(T--){
    		memset(a , 0 , sizeof(a));
    		scanf("%d", &n);
    		m = n;
    		j = 0;
    		while(m >= 1){
    			a[j++] = m;
    			for(i = 0; i < m; i++){
    				a[j] = a[j- (n-m) ];
    				j++;
    			}	
    			m--;
    		}
    		for(i = j-1; i>=j-n; i--)
    			printf("%d ", a[i]);
    		printf("
    "); 
    	}
    	return 0;
    } 
    
  • 相关阅读:
    expect简介和使用例子(转)
    openshift网络
    openstack相关
    SDN的开源方案sonic
    OpenStack Neutron ML2 Deep Dive
    2017双11技术揭秘—阿里数据库计算存储分离与离在线混布
    es的gui工具
    django orm中blank和null的区别
    断关联多表关系阐述
    视图使用
  • 原文地址:https://www.cnblogs.com/zyq1758043090/p/11852756.html
Copyright © 2011-2022 走看看