1042 Shuffling Machine (20 分)简洁易懂，无需繁琐操作数组

最新推荐文章于 2021-02-21 21:00:17 发布
最新推荐文章于 2021-02-21 21:00:17 发布
阅读量202 收藏
点赞数
分类专栏： PAT 文章标签： PAT
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/yunshen2711/article/details/100563622
版权
本文详细解析PAT考试中的1042题，通过利用下标变化来简化数组操作，实现高效解决方案。附带测试点运行结果截图。
摘要由CSDN通过智能技术生成

1042 Shuffling Machine题解

因为每一趟的顺序改变，都只是下标的改变，其值不会发生变换，以空间换时间

1、把下标值index和card的值存放在一个结构体中
2、每一趟将结构体中的index更新
3、以index从小到大的顺序 sort（）结构体
4、重复第一步，操作次数为k

#include <iostream>
#include <algorithm>
#include <string.h>
using namespace std;


int order[54];

struct node
{
   
    int v;
    int pos;
}card[54];

bool cmp(node a,node b)
{
   
    return a.pos<b.pos;
}

string getName(<
最低0.47元/天 解锁文章
phzzzzz
关注
专栏目录
1042 Shuffling Machine (20分)
小白的博客
02-15 151
题目 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 gamb...
042. Shuffling Machine (20)
sheng_xc的专栏
09-25 879
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 gambler
1042. Shuffling Machine (20)【模拟】——PAT (Advanced Level) Practise
12-06 1601
题目信息1042. Shuffling Machine (20)时间限制400 ms 内存限制65536 kB 代码长度限制16000 BShuffling is a procedure used to randomize a deck of playing cards. Because standard shuffling techniques are seen as weak, and in
PAT(甲级)1042 Shuffling Machine （20 分)
Eggy个蛋
04-09 250
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 gambler...
PAT 1042 Shuffling Machine (20 分) (Python 实现)（中文）
d_l_w_d_l_w的博客
02-21 248
题目： 洗牌是一个程序，用于随机一副扑克牌。由于标准洗牌技术被视为薄弱环节，而且为了避免员工通过执行不适当的洗牌来与赌徒合作的“内部工作”，许多赌场采用自动洗牌机。你的任务是模拟洗牌机。 这台机器根据给定的随机顺序洗牌一副54张牌，并重复给定的次数。假设卡片组的初始状态按以下顺序排列： S1, S2, …, S13, H1, H2, …, H13, C1, C2, …, C13, D1, D2, …, D13, J1, J2 其中“S”代表“Spade”，“H”代表“Heart”，“C”代表“Club”，
[C/C++] 1042 Shuffling Machine (20 分)
dulongxiang の blog
07-28 302
1042 Shuffling Machine (20 分) 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 empl...
A1042 Shuffling Machine (20分)【C语言】
SASAKI_130的博客
05-24 389
A1042 Shuffling Machine (20分)【C语言】 原题链接 题目要求很简单，按照给定的洗牌次数和洗牌序列，最终输出洗好的牌。 初始时牌的顺序为 S1, S2, …, S13, H1, H2, …, H13, C1, C2, …, C13, D1, D2, …, D13, J1, J2 注意牌的序号和数组下标的关系，可以在0号下标不存储元素，则实现了一一对应的关系 题目描述： Shuffling is a procedure used to randomize a deck of pl
1042 Shuffling Machine （20 分）
virgilshi的博客
10-09 198
1042 Shuffling Machine （20 分） 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 empl...
1042 Shuffling Machine (20)（20 分）
Dai
08-22 229
#include&lt;iostream&gt; #include&lt;string&gt; #include&lt;cstring&gt; using namespace std; const int maxn = 1e3 + 10; int num[maxn], temp[maxn],shuff[maxn], k; void show(int n) { if (n &lt;= 13)pr...
1042 Shuffling Machine (20 分)
树叶子的博客
12-23 264
1042Shuffling Machine(20分) 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 emp...
pat 甲级 1042 Shuffling Machine
咸鱼之井的博客
08-16 148
好想打自己啊 很简单的一道题 想了那么半天都没想出来 最后的输出有点麻烦，可以学习下大佬们的建立数组输出 #include &lt;cstdio&gt; #include &lt;iostream&gt; using namespace std; int k; int arr[60]; int brr[60]; int crr[60]; int main(){ scanf(...
1042 Shuffling Machine
qq_40486952的博客
01-16 193
Shuffling Machine原题链接解题思路如何进行洗牌如何输出花色 原题链接 PAT甲级 1042 Shuffling Machine 解题思路 如何进行洗牌 我认为要有两个数组分别存放上一次的洗牌结果和当下洗牌结果，不能一边用该数组一边又在变化这个数组（本来以为每张牌的新位置不同不会有影响，后来发现还是会出错因为要用到上一次洗牌某号位置的牌而可能此时已经在这次洗牌中变化了。） 如何输出花...
1042 Shuffling Machine
mayuejike的博客
01-15 201
1042 Shuffling Machine （20 分） 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 emp...
shuffling machinec＋＋
最新发布
03-28
A shuffling machine in C++ can be implemented using an array to represent the deck of cards and using the random number generator to shuffle the cards. Here is a sample code for a shuffling machine: ``` #include <iostream> #include <cstdlib> #include <ctime> using namespace std; const int NUM_CARDS = 52; class ShufflingMachine { private: int deck[NUM_CARDS]; int position; public: ShufflingMachine() { for (int i = 0; i < NUM_CARDS; i++) { deck[i] = i; } position = 0; } void shuffle() { srand(time(NULL)); for (int i = 0; i < NUM_CARDS; i++) { int j = rand() % NUM_CARDS; swap(deck[i], deck[j]); } position = 0; } int dealCard() { if (position >= NUM_CARDS) { shuffle(); } return deck[position++]; } }; int main() { ShufflingMachine shuffler; shuffler.shuffle(); for (int i = 0; i < NUM_CARDS; i++) { cout << shuffler.dealCard() << " "; } cout << endl; return 0; } ``` In this code, the `ShufflingMachine` class represents the shuffling machine. The `deck` array stores the deck of cards, and the `position` variable keeps track of the current position in the deck. The `shuffle` method shuffles the deck by randomly swapping cards. It uses the `srand` function to seed the random number generator with the current time, and the `rand` function to generate random indices for swapping cards. The `dealCard` method deals the next card from the deck. If the deck has been exhausted, it calls the `shuffle` method to shuffle the cards again. In the `main` function, we create a `ShufflingMachine` object and shuffle the cards. Then we deal all the cards and print them out.
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

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

抵扣说明：

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

余额充值