| 시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
|---|---|---|---|---|---|
| 2 초 | 512 MB | 21 | 14 | 13 | 65.000% |
Vera has A × B cards. Each card has a rank, an integer between 0 and A − 1, and a suit, an integer between 0 and B − 1. All cards are distinct. A set of five different cards is known as a hand. Each hand is in exactly one of nine categories numbered from 1 to 9. If a hand satisfies the conditions for membership in multiple categories, it is considered to be in the lowest-numbered such category. The rules for each category are:
Currently, Vera has two cards with ranks a1, a2 and suits b1, b2. Of the remaining cards, Vera will choose three more cards and form a hand with her two current cards. Compute the number of different hands formed in this way that belong in each category.
Line 1 contains integers A and B (5 ≤ A ≤ 25, 1 ≤ B ≤ 4).
Line 2 contains integers a1, b1, a2, b2 (0 ≤ a1, a2 ≤ A − 1, 0 ≤ b1, b2 ≤ B − 1, (a1, b1) ≠ (a2, b2)).
Print one line with nine integers, the number of different of hands that belong in each category in increasing order of categories (from Straight flush to High card).
5 2 1 0 3 1
0 0 0 0 8 0 12 36 0
13 4 0 0 1 0
1 2 18 164 63 308 792 7920 10332
Let (a, b) denote a card with rank a and suit b.
For the first example, Vera currently has cards (1, 0) and (3, 1). If she chooses additional cards (3, 0),(4, 0),(4, 1), her hand will be a Two pair as there are two cards with rank 3 and two other cards with rank 4. Note that this hand also satisfies being a One pair, but Two pair is the lower-numbered category.