Shuffling Machine(洗牌机) — C语言【洗牌顺序和次数由你决定】

题目:

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:

(译文:这台机器根据给定的随机顺序洗54张牌,并重复给定的次数。假设一副牌的初始状态顺序如下:)

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.

(译文:“S”代表“Spade”,“H”代表“Heart”,“C”代表“Club”,“D”代表“Diamond”,“J”代表“Joker”。给定的顺序是[1,54]中不同整数的排列。如果第i个位置的数字是j,表示将牌从i位置移动到j位置。例如,假设我们只有5张牌:S3、H5、C1、D13和J2。给定洗牌顺序{4,2,5,3,1},结果为:J2, H5, D13, S3, C1。如果我们要重复洗牌,结果是:C1, H5, S3, J2, D13【设计时可先以此为例,之后再拓展到54张牌】

输入格式:

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.

(译文:每个输入文件包含一个测试用例。对于每种情况,第一行包含一个正整数K(≤20),这是重复次数。然后下一行包含给定的顺序。一行中的所有数字都用空格隔开。)

输出格式:

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.

(译文:对于每个测试用例,在一行中打印洗牌结果。所有卡片之间用空格隔开行尾不得有空格。)

代码:

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#define MAX 54
int main() {
    //洗牌机:
    //1.用二维数组来存放54张牌,共54行4列(字符串形式初始化,每行以'\0'结束)
    char card[MAX][4] = { "S1","S2","S3","S4","S5","S6","S7","S8","S9","S10","S11","S12","S13",
                         "H1","H2","H3","H4","H5","H6","H7","H8","H9","H10","H11","H12","H13",
                         "C1","C2","C3","C4","C5","C6","C7","C8","C9","C10","C11","C12","C13",
                         "D1","D2","D3","D4","D5","D6","D7","D8","D9","D10","D11","D12","D13",
                         "J1","J2" };

    int k = 1;        
    if (scanf("%d", &k) == 1); //k记录设定的循环次数

    //2.用一维数组记录输入的随机顺序
    int order[MAX] = { 0 };
    for (int j = 0; j < MAX; j++) { 
        int num = 0;
        if (scanf("%d", &num) == 1);
        order[j] = num;
    }

    //3.用新的二维数组来接收顺序改变后的54张牌
    char result[MAX][4] = { "0" };
    for (int count = 0; count < k; count++) { //按照给定顺序洗k次牌
        for (int i = 0; i < MAX; i++) {      //将card数组存放的54张牌依次按照order数组中指定的顺序存放到result数组中
            int t;
            t = order[i] - 1;
            for (int j = 0; j < 4; j++) {
                result[t][j] = card[i][j];
            }
        }
        for (int i = 0; i < MAX; i++) { //一次洗牌后将card数组中牌的顺序更新,便于下次洗牌
            for (int j = 0; j < 4; j++) {
                card[i][j] = result[i][j];
            }
        }
    }
    //4.输出洗牌后的结果
    for (int j = 0; j < MAX; j++) {
        for (int i = 0; result[j][i] != '\0'; i++) {
            printf("%c", result[j][i]);
        }
        if (j != (MAX-1)) {
            printf(" ");
        }
    }
    return 0;
}

结果:

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

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


★要是觉得还不错,就点个赞吧☛

  • 7
    点赞
  • 11
    收藏
    觉得还不错? 一键收藏
  • 2
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论 2
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值