Tokitsukaze aims to win a mahjong-derived game by forming at least one mentsu. The problem involves determining the minimum number of additional suited tiles she needs to draw. A mentsu can be a koutsu (triplet) or a shuntsu (sequence). The task is to analyze the initial hand and find the minimum draws required, considering an infinite supply of each suited tile."
111365330,10292959,Redis在分布式架构中的应用：接口幂等、分布式锁与session管理,"['分布式架构', 'Redis', '缓存', '接口设计', '数据一致性']
B. Tokitsukaze and Mahjong
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
Tokitsukaze is playing a game derivated from Japanese mahjong. In this game, she has three tiles in her hand. Each tile she owns is a suited tile, which means it has a suit (manzu, pinzu or souzu) and a number (a digit ranged from 11 to 99). In this problem, we use one digit and one lowercase letter, which is the first character of the suit, to represent a suited tile. All possible suited tiles are represented as 1m, 2m, ……, 9m, 1p, 2p, ……, 9p, 1s, 2s, ……, 9s.
In order to win the game, she must have at least one mentsu (described below) in her hand, so sometimes she should draw extra suited tiles. After drawing a tile, the number of her tiles increases by one. She can draw any tiles she wants, including those already in her hand.
Do you know the minimum number of
最低0.47元/天 解锁文章
513
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
