zoukankan      html  css  js  c++  java
  • 00-自测5. 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.

    #include<iostream>
    #include<string>
    using namespace std;
    int main() {
        int j;
        int i;
        int N;
        int arr[54];
        string b[55];
        string a[54] = { "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" };
        cin >> N;
        for (i = 0; i < 54; i++) {
            cin >> arr[i];
        }
        for (j = 1; j <= N; j++) {
            for (i = 0; i < 54; i++)
                b[arr[i] - 1] = a[i];
            for (i = 0; i < 54; i++)
                a[i] = b[i];
        }
        for (i = 0; i < 53; i++) {
            cout << a[i] << " ";
        }
        cout << a[53] << endl;
        return 0;
    }
  • 相关阅读:
    java代码split分割数字类
    P1330 封锁阳光大学
    1022 舞会2
    1626 爱在心中
    P2024 食物链(two)
    P1196 银河英雄传说
    P1892 团伙
    P1546 最短网络(最小生成树)
    烦人的幻灯片(拓扑)
    例4.15 奖金(拓扑排序)
  • 原文地址:https://www.cnblogs.com/sindy/p/4555769.html
Copyright © 2011-2022 走看看