Time limit
2s
Memory limit
128 MB
Poker is played by comparing the strongest hand type that can be made from the cards a player holds.
The hand types, from weakest to strongest, are as follows.
A, 2, 3, 4, 5.A, K, Q, J, 10.A, 2, 3, 4, 5.There is a standard deck of 52 cards. It has four suits, called tree, club, spade, and moon here, and each suit contains cards with ranks A, 2, 3, 4, 5, 6, 7, 8, 9, 10, J, Q, K.
In this problem, the game is six-card poker. You receive 6 cards, and you must compute the probability that each hand type is the strongest hand type that can be made.
If some subset of the cards makes a stronger hand type, weaker hand types in the same 6-card hand are ignored. Therefore, the probabilities of the 12 hand types sum to 1.
Find the probability of each hand type.
No input is given.
Print the probabilities of the hand types in the order listed above, one per line. Each line must be a reduced fraction in the form a/b.
In ordinary poker, a royal straight flush is often A, K, Q, J, 10 of the same suit. In this problem, follow the definition given above: the royal straight flush is A, 2, 3, 4, 5 of the same suit.