Codeforces Round 573 (Div. 2)
B
Tokitsukaze and Mahjong
Codeforces
1200
原题
← AC →
翻译中…

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 $1$ to $9$). 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, $\ldots$, 9m, 1p, 2p, $\ldots$, 9p, 1s, 2s, $\ldots$, 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 extra suited tiles she needs to draw so that she can win?

翻译中…

Here are some useful definitions in this game:

翻译中…
  • A mentsu, also known as meld, is formed by a koutsu or a shuntsu;
  • A koutsu, also known as triplet, is made of three identical tiles, such as [1m, 1m, 1m], however, [1m, 1p, 1s] or [1m, 4m, 7m] is NOT a koutsu;
  • A shuntsu, also known as sequence, is made of three sequential numbered tiles in the same suit, such as [1m, 2m, 3m] and [5s, 7s, 6s], however, [9m, 1m, 2m] or [1m, 2p, 3s] is NOT a shuntsu.
翻译中…

Some examples:

翻译中…
  • [2m, 3p, 2s, 4m, 1s, 2s, 4s] — it contains no koutsu or shuntsu, so it includes no mentsu;
  • [4s, 3m, 3p, 4s, 5p, 4s, 5p] — it contains a koutsu, [4s, 4s, 4s], but no shuntsu, so it includes a mentsu;
  • [5p, 5s, 9m, 4p, 1s, 7p, 7m, 6p] — it contains no koutsu but a shuntsu, [5p, 4p, 6p] or [5p, 7p, 6p], so it includes a mentsu.
翻译中…

Note that the order of tiles is unnecessary and you can assume the number of each type of suited tiles she can draw is infinite.

翻译中…

Input

翻译中…

The only line contains three strings — the tiles in Tokitsukaze's hand. For each string, the first character is a digit ranged from $1$ to $9$ and the second character is m, p or s.

翻译中…

Output

翻译中…

Print a single integer — the minimum number of extra suited tiles she needs to draw.

翻译中…

Note

翻译中…

In the first example, Tokitsukaze already has a shuntsu.

翻译中…

In the second example, Tokitsukaze already has a koutsu.

翻译中…

In the third example, Tokitsukaze can get a shuntsu by drawing one suited tile — 1p or 4p. The resulting tiles will be [3p, 9m, 2p, 1p] or [3p, 9m, 2p, 4p].

翻译中…

样例

Input #1
1s 2s 3s
Output #1
0
InputCopy OutputCopy
Input #2
9m 9m 9m
Output #2
0
InputCopy OutputCopy
Input #3
3p 9m 2p
Output #3
1
InputCopy OutputCopy
题目信息
题号
1191B
时间限制
1 s
内存限制
256 MB
标签
暴力
模拟

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。