随机发牌 代码
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 | // random.cpp : 定义控制台应用程序的入口点。 // #include "stdafx.h" #include <random> #include <time.h> #include <list> #include <assert.h> #include <iostream> #include <vector> #include <functional> const int MAJIANG_GROUP_LENGTH = 84; const int POST_BLOCK_COUNT = 4; const int PLAYER_COUNT = 3; /* 0x01,0x02,0x03,0x04,0x05,0x06,0x07,0x08,0x09,//一到九筒 0x11,0x12,0x13,0x14,0x15,0x16,0x17,0x18,0x19,//一到九条 0x30,//中 0x40,//发 0x50,//白 */ const std::vector<unsigned char > originMajiangGroup = { 0x01,0x02,0x03,0x04,0x05,0x06,0x07,0x08,0x09, 0x01,0x02,0x03,0x04,0x05,0x06,0x07,0x08,0x09, 0x01,0x02,0x03,0x04,0x05,0x06,0x07,0x08,0x09, 0x01,0x02,0x03,0x04,0x05,0x06,0x07,0x08,0x09, //筒 0x11,0x12,0x13,0x14,0x15,0x16,0x17,0x18,0x19, 0x11,0x12,0x13,0x14,0x15,0x16,0x17,0x18,0x19, 0x11,0x12,0x13,0x14,0x15,0x16,0x17,0x18,0x19, 0x11,0x12,0x13,0x14,0x15,0x16,0x17,0x18,0x19, //条 0x30,0x30,0x30,0x30, //中 0x40,0x40,0x40,0x40, //发 0x50,0x50,0x50,0x50, //白 }; std::list<unsigned char > playerMajiangList[PLAYER_COUNT]; void PostMajiangBlockToPlayerOnce(std::vector<unsigned char >& group , int posCount) { for ( int index = 0; index < PLAYER_COUNT; ++index) { //一次向游戏玩家发送 PLAYER_COUNT 张牌 for ( int i = 0; i < posCount; ++i) { playerMajiangList[index].push_back( group .back()); group .pop_back(); } } } void PostMajiangBlock(std::vector<unsigned char >& group ) { PostMajiangBlockToPlayerOnce( group , POST_BLOCK_COUNT); PostMajiangBlockToPlayerOnce( group , POST_BLOCK_COUNT); PostMajiangBlockToPlayerOnce( group , POST_BLOCK_COUNT); PostMajiangBlockToPlayerOnce( group , 1); } void InitFixMajiang(std::vector<unsigned char >& group ) { std::default_random_engine generator(time(NULL)); std::uniform_int_distribution< int > dis(0, group .size()-1); auto dice = std::bind(dis, generator); int index1,index2; unsigned char tmp; for ( int i = 0; i<100; i++) { index1 = dice(); index2 = dice(); tmp = group [index1]; group [index1] = group [index2]; group [index2] = tmp; } } int main() { std::vector<unsigned char > currentMajiangGroup = originMajiangGroup; for (size_t i = 0; i < currentMajiangGroup.size(); ++i) { std::cout << std::hex << (unsigned int )currentMajiangGroup[i] << ' ' ; } //洗牌 InitFixMajiang(currentMajiangGroup); std::cout << std::endl; for (size_t i = 0; i < currentMajiangGroup.size(); ++i) { std::cout << std::hex << (unsigned int )currentMajiangGroup[i] << ' ' ; } PostMajiangBlock(currentMajiangGroup); std::cout << std::endl; for ( int i = 0; i < PLAYER_COUNT; ++i) { playerMajiangList[i].sort(); std::cout << "player" << i << " : " ; for (auto ele : playerMajiangList[i]) { std::cout << std::hex << (unsigned int )ele << " " ; } std::cout << std::endl; } return 0; } |
作 者: itdef
欢迎转帖 请保持文本完整并注明出处
技术博客 http://www.cnblogs.com/itdef/
B站算法视频题解
https://space.bilibili.com/18508846
qq 151435887
gitee https://gitee.com/def/
欢迎c c++ 算法爱好者 windows驱动爱好者 服务器程序员沟通交流
如果觉得不错,欢迎点赞,你的鼓励就是我的动力
欢迎转帖 请保持文本完整并注明出处
技术博客 http://www.cnblogs.com/itdef/
B站算法视频题解
https://space.bilibili.com/18508846
qq 151435887
gitee https://gitee.com/def/
欢迎c c++ 算法爱好者 windows驱动爱好者 服务器程序员沟通交流
如果觉得不错,欢迎点赞,你的鼓励就是我的动力


【推荐】国内首个AI IDE,深度理解中文开发场景,立即下载体验Trae
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步
· go语言实现终端里的倒计时
· 如何编写易于单元测试的代码
· 10年+ .NET Coder 心语,封装的思维:从隐藏、稳定开始理解其本质意义
· .NET Core 中如何实现缓存的预热?
· 从 HTTP 原因短语缺失研究 HTTP/2 和 HTTP/3 的设计差异
· 分享一个免费、快速、无限量使用的满血 DeepSeek R1 模型,支持深度思考和联网搜索!
· 基于 Docker 搭建 FRP 内网穿透开源项目(很简单哒)
· ollama系列1:轻松3步本地部署deepseek,普通电脑可用
· 按钮权限的设计及实现
· 25岁的心里话
2016-08-15 CMAKE 教程前两章节学习