当前位置: 首页 > news >正文

c语言编程练习题:7-43 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 D

#include <stdio.h>
#include <string.h>
int main(){char cards[54][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,res,i,j,t;char s1[54][4];int num[54];res = scanf("%d",&K);if (res==EOF){printf("输入的K值错误");}// 获取排序的值for (i=0;i<54;i++){res = scanf("%d",&num[i]);if (res==EOF){printf("输入的order值错误");}}for (i=0;i<K;i++){// 把cards根据num序号排序,并赋值给s1for (j=0;j<54;j++){t = num[j];strcpy(s1[t-1] , cards[j]);}// 把s1的值复制给cardsfor (j=0;j<54;j++){strcpy(cards[j],s1[j]);}}// 输出具体的字符for (i=0;i<54;i++){printf("%s",cards[i]);if (i!=53){printf(" ");}}return 0;
}

代码来自:https://yunjinqi.top/article/168

http://www.lryc.cn/news/91166.html

相关文章:

  • ffmpeg enum AVChannel枚举解析
  • invest模型教程
  • LinuxShell编程
  • stm32学习笔记-11 SPI通信
  • “微商城”项目(3页面布局)
  • Java 八股文 - MySQL
  • 周赛347(模拟、思维题、动态规划+优化)
  • String AOP的使用
  • 华为芯片基地旁,龙华科技小镇大水坑片区城市更新单元旧改项目
  • 论文阅读 | 频谱监测、认知电子战、网电攻击
  • MySQL server安装记录
  • 平衡树原理讲解
  • SpringMVC框架面试专题(初级-中级)-第七节
  • 爬虫实战案例
  • ConcurrentLinkedQueue非阻塞无界链表队列
  • 排序算法稳定性
  • 统计学期末复习整理
  • Sketch在线版免费使用,Windows也能用的Sketch!
  • 详解uni-app项目运行在安卓真机调试
  • 体积小、无广告、超实用的5款小工具
  • OZON好出单吗?新手如何做?注意事项是什么?
  • 性能测试需求分析有哪些?怎么做?
  • STM32F103RCT6 -- 基于FreeRTOS 的USART1 串口通讯
  • 区间预测 | MATLAB实现基于QRCNN-LSTM-Multihead-Attention多头注意力卷积长短期记忆神经网络多变量时间序列区间预测
  • 递归--打印一个字符串的全部排列(java)
  • 【001 设备驱动】主设备号和次设备号的用途
  • 移动端PDF在线预览
  • 虚拟机两次寻址
  • DRF之JWT认证
  • 华为OD机试真题 Java 实现【放苹果】【2022Q4 100分】