PTA A1042 Shuffling Machine（洗牌机器之妙不可言的输出）

最新推荐文章于 2022-05-07 12:04:21 发布

Zeal Young

最新推荐文章于 2022-05-07 12:04:21 发布

阅读量358

点赞数 1

CC 4.0 BY-SA版权

分类专栏： Notes on Algorithm PTA 算法笔记文章标签：巧妙算法洗牌机器

知识内容为原创思考，转载请注明：由AhaKnow分享

本文链接：https://blog.youkuaiyun.com/SmartLoveyu/article/details/89431590

博客探讨了PTA A1042题目的洗牌机器问题，解析了如何处理13的倍数情况，提出了一种通过条件判断和巧妙处理模运算避免13整数倍数字出现的方法，同时关注到了输出中的空格处理技巧。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目内容如下：

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. G