|
||||||||||
MahjongTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 367 Accepted Submission(s): 123 Problem Description Mahjong is a wonderful game which origins from China (or maybe Korea because everything is Korean). Mahjong is also a complex game. But the game we play here is rather easy. It just contains three suits: stones, bamboos and characters. Stones consist of a number of circles. Each circle is said to represent can (Ͳ, t¨®ng) coins with a square hole in the middle. Bamboos consist of a number of bamboo sticks. Each stick is said to represent a string (Ë÷, su¨¯) that holds a hundred coins. Note that 1 Bamboo is an exception: it has a bird sitting on a bamboo, to prevent alteration. Each character represents ten thousand (Èf, w¨¤n) coins. A player wins the round by creating a standard mahjong hand, which consists of a certain number of melds (namely, four for 13-tile variations) and a pair. A meld is three tiles which are adjacent in one suit or all the same. A pair is two same tiles. Now one player has three tiles in hand. Can you tell what more tile he need to win? Note that the number of each tile in Mahjong is four. So if the number of one tile the player has is four, he cannot get this tile anymore. Input The first line contains one integer T indicating the number of test cases. For each case, there are thirteen tiles in one line, separated by one space. Each tile has two characters. The first character is ¡®1¡¯ to ¡®9¡¯ and the second is ¡®s¡¯ (for stone), ¡®b¡¯ (for bamboo), or ¡®c¡¯ (for character). Output For each case, output one line containing the case number and all the tiles he needs to win the round, separated by one space. If he needs more than one tile, first output stone, then bamboo, finally character, all from 1 to 9. If he cannot win after get any tile, output ¡°None¡± instead. Please follow the format of the sample output. Sample Input
Sample Output
Author xay@whu Source | ||||||||||
|