HDU 4431 Mahjong （麻将、神坑模拟题）

David_Jett

于 2015-07-27 18:32:08 发布

阅读量2.8k

点赞数

分类专栏：总结编程题——模拟文章标签： hdu 区域赛模拟

本文链接：https://blog.youkuaiyun.com/David_Jett/article/details/47088687

版权

题目介绍了HDU 4431 Mahjong这一神坑模拟题，讨论了三种可能的胜利条件：国士无双、七对不同对子和特定组合。文章强调了编程过程中的坑点，如检查不同对子、保持状态合法性和枚举牌数不超过4张。此外，还分享了解决问题后的总结，包括变量还原、代码精简、数据合法性检查和逻辑推敲的重要性。

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

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=4431

题面：

Mahjong

Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 4219 Accepted Submission(s): 842

Problem Description

Japanese Mahjong is a four-player game. The game needs four people to sit around a desk and play with a set of Mahjong tiles. A set of Mahjong tiles contains four copies of the tiles described next:

One to nine Man, which we use 1m to 9m to represent;

One to nine Sou, which we use 1s to 9s to represent;

One to nine Pin, which we use 1p to 9p to represent;

Character tiles, which are:Ton, Nan, Sei, Pei, Haku, Hatsu, Chun, which we use 1c to 7c to represent.

A winning state means a set of 14 tiles that normally contains a pair of same tiles (which we call "eyes") and four melds. A meld is formed by either three same tiles(1m, 1m, 1m or 2c, 2c, 2c for example) or three continuous non-character tiles(1

最低0.47元/天解锁文章