zoukankan      html  css  js  c++  java
  • A1042. Shuffling Machine

    Shuffling is a procedure used to randomize a deck of playing cards. Because standard shuffling techniques are seen as weak, and in order to avoid "inside jobs" where employees collaborate with gamblers by performing inadequate shuffles, many casinos employ automatic shuffling machines. Your task is to simulate a shuffling machine.

    The machine shuffles a deck of 54 cards according to a given random order and repeats for a given number of times. It is assumed that the initial status of a card deck is in the following order:

    S1, S2, ..., S13, H1, H2, ..., H13, C1, C2, ..., C13, D1, D2, ..., D13, J1, J2

    where "S" stands for "Spade", "H" for "Heart", "C" for "Club", "D" for "Diamond", and "J" for "Joker". A given order is a permutation of distinct integers in [1, 54]. If the number at the i-th position is j, it means to move the card from position i to position j. For example, suppose we only have 5 cards: S3, H5, C1, D13 and J2. Given a shuffling order {4, 2, 5, 3, 1}, the result will be: J2, H5, D13, S3, C1. If we are to repeat the shuffling again, the result will be: C1, H5, S3, J2, D13.

    Input Specification:

    Each input file contains one test case. For each case, the first line contains a positive integer K (<= 20) which is the number of repeat times. Then the next line contains the given order. All the numbers in a line are separated by a space.

    Output Specification:

    For each test case, print the shuffling results in one line. All the cards are separated by a space, and there must be no extra space at the end of the line.

    Sample Input:

    2
    36 52 37 38 3 39 40 53 54 41 11 12 13 42 43 44 2 4 23 24 25 26 27 6 7 8 48 49 50 51 9 10 14 15 16 5 17 18 19 1 20 21 22 28 29 30 31 32 33 34 35 45 46 47
    

    Sample Output:

    S7 C11 C10 C12 S1 H7 H8 H9 D8 D9 S11 S12 S13 D10 D11 D12 S3 S4 S6 S10 H1 H2 C13 D2 D3 D4 H6 H3 D13 J1 J2 C1 C2 C3 C4 D1 S5 H5 H11 H12 C6 C7 C8 C9 S2 S8 S9 H10 D5 D6 D7 H4 H13 C5
    
     1 #include<cstdio>
     2 #include<iostream>
     3 using namespace std;
     4 
     5 char num2ch(int n){
     6     if((n - 1) / 13 == 0)
     7         return 'S';
     8     else if((n - 1) / 13 == 1)
     9         return 'H';
    10     else if((n - 1) / 13 == 2)
    11         return 'C';
    12     else if((n - 1) / 13 == 3)
    13         return 'D';
    14     else return 'J';
    15 }
    16 int main(){
    17     int K;
    18     int src[55], re[55], shuff[55];
    19     scanf("%d", &K);
    20     for(int i = 1; i < 55; i++){
    21         src[i] = i;
    22         scanf("%d", &shuff[i]);
    23     }
    24     for(int i = 0; i < K; i++){
    25         for(int j = 1; j < 55; j++)
    26             re[shuff[j]] = src[j];
    27         for(int j = 1; j < 55; j++)
    28             src[j] = re[j];
    29     }
    30     printf("%c%d", num2ch(re[1]), (re[1] - 1) % 13 + 1);
    31     for(int i = 2; i < 55; i++)
    32         printf(" %c%d", num2ch(re[i]), (re[i] - 1) % 13 + 1);
    33     return 0;
    34 
    35 }
    View Code

    总结:1、由于置换时会覆盖旧元素,所以使用两个数组,一个暂存所有元素,一个用于置换。

       2、使用1-54数字表示牌,最后再换算成1-13的牌。 (i - 1) %13 + 1

  • 相关阅读:
    nacos + seata 报错 endpoint format should like ip:port
    Error creating bean with name 'com.example.demo.ProviderFacade': Requested bean is currently in creation: Is there an unresolvable circular reference?
    leetcode 剑指 Offer 65不用加减乘除做加法
    vscode使用spring boot配置详解
    使用springmvc中视图解析器InternalResourceViewResolver遇到访问出错
    docker tomcat修改时区有效方法
    wsl2 docker mysql重启之后无法连接问题
    docker tomcat部署应用并且连接到docker mysql数据库
    vscode git使用
    vscode wsl2使用maven操作{添加包到meavn,测试操作}
  • 原文地址:https://www.cnblogs.com/zhuqiwei-blog/p/8428441.html
Copyright © 2011-2022 走看看