UVA 11210 (大白上的枚举题 麻将 14.4.15)

Problem C

Chinese Mahjong

Mahjong () is a game of Chinese origin usually played by four persons with tiles resembling dominoes and bearing various designs, which are drawn and discarded until one player wins with a hand of four combinations of three tiles each and a pair of matching tiles.

A set of Mahjong tiles will usually differ from place to place. It usually has at least 136 tiles, most commonly 144, although sets originating from America or Japan will have more. The 136-tile Mahjong includes:

Dots: named as each tile consists of a number of circles. Each circle is said to represent copper (tong) coins with a square hole in the middle. In this problem, they're represented by 1T, 2T, 3T, 4T, 5T, 6T, 7T, 8T and 9T.

Bams: named as each tile (except the 1 Bamboo) consists of a number of bamboo sticks. Each stick is said to represent a string (suo) that holds a hundred coins. In this problem, they're represented by 1S, 2S, 3S, 4S, 5S, 6S, 7S, 8S and 9S.

Craks: named as each tile represents ten thousand (wan) coins, or one hundred strings of one hundred coins. In this problem, they're represented by 1W, 2W, 3W, 4W, 5W, 6W, 7W, 8W and 9W.

Wind tiles: East, South, West, and North. In this problem, they're represented by DONG, NAN, XI, BEI.

Dragon tiles: red, green, and white. The term dragon tile is a western convention introduced by Joseph Park Babcock in his 1920 book introducing Mahjong to America. Originally, these tiles are said to have something to do with the Chinese Imperial Examination. The red tile means you pass the examination and thus will be appointed a government official. The green tile means, consequently you will become financially well off. The white tile (a clean board) means since you are now doing well you should act like a good, incorrupt official. In this problem, they're represented by ZHONG, FA, BAI.

There are 9*3+4+3=34 kinds, with exactly 4 tiles of each kind, so there are 136 tiles in total.

To who may be interested, the 144-tile Mahjong also includes:

Flower tiles:

typically optional components to a set of mahjong tiles, often contain artwork on their tiles. There are exactly one tile of each kind, so 136+8=144 tiles in total. In this problem, we don��t consider these tiles.

Chinese Mahjong is very complicated. However, we only need to know very few of the rules in order to solve this problem. A meld is a certain set of tiles in one's hand. There are three kinds of melds you need to know (to who knows Mahjong already, kong is not considered):

Pong: A set of three identical titles. Example: ;.

Chow: A set of three suited tiles in sequence. All three tiles must be of the same suites. Sequences of higher length are not permissible (unless it forms more than one meld). Obviously, wind tiles and dragon tiles can never be involved in chows. Example:;.

Eye: The pair, while not a meld, is the final component to the standard hand. It consists of any two identical tiles.

A player wins the round by creating a standard mahjong hand. That means, the hand consists of an eye and several (possible zero) pongs and chows. Note that each title can be involved in exactly one eye/pong/chow.

When a hand is one tile short of wining, the hand is said to be a ready hand, or more figuratively, 'on the pot'. The player holding a ready hand is said to be waiting for certain tiles. For example

is waiting for , and .

To who knows more about Mahjong: don't consider special winning hands such as ''.

Input

The input consists of at most 50 test cases. Each case consists of 13 tiles in a single line. The hand is legal (e.g. no invalid tiles, exactly 13 tiles). The last case is followed by a single zero, which should not be processed.

Output

For each test case, print the case number and a list of waiting tiles sorted in the order appeared in the problem description (1T~9T, 1S~9S, 1W~9W, DONG, NAN, XI, BEI, ZHONG, FA, BAI). Each waiting tile should be appeared exactly once. If the hand is not ready, print a message 'Not ready' without quotes.

Sample Input

1S 1S 2S 2S 2S 3S 3S 3S 7S 8S 9S FA FA
1S 2S 3S 4S 5S 6S 7S 8S 9S 1T 3T 5T 7T
0

Output for the Sample Input

Case 1: 1S 4S FA
Case 2: Not ready

做题心得:这是大白书上的例题, 看完完整的思路和代码后 重新敲的, 事先是觉得毫无头绪, 看完再敲一遍觉得真的是思路理清了再去做速度很快.

思路:枚举每一张麻将牌, 看是否可以胡, 在这个枚举之下还有嵌套枚举, 就是加入第i个麻将后, 枚举手上14张牌中怎么选对子, 每个对子选完后, 就去递归查询是否剩下的牌都是ABC型 或是 AAA型就好了

AC代码 有注释:

#include<stdio.h>
#include<string.h>
int has[35];
const char * majiang[] = {"1T", "2T", "3T", "4T", "5T", "6T", "7T", "8T", "9T", 
        "1S", "2S", "3S", "4S", "5S", "6S", "7S", "8S", "9S",
        "1W", "2W", "3W", "4W", "5W", "6W", "7W", "8W", "9W",
        "DONG", "NAN", "XI", "BEI",
        "ZHONG", "FA", "BAI"};
//转化函数, 把牌从字符串变为int数值表示
int convert(char *s) {
 for(int i = 0; i < 34; i++) {
  if(strcmp(s, majiang[i]) == 0)
   return i;
 }
 return -1;
}
//找三张相同牌或者三张顺子牌
int search(int num) {
 int i;
 //找三张相同
 for(i = 0; i < 34; i++) {
  if(has[i] >= 3) {
   if(num == 3)
    return 1;
   has[i] -= 3;
   if(search(num+1))
    return 1;
   has[i] += 3;
  }
 }
 
 //找顺子, 注意风牌箭牌不能拼顺子
 for(i = 0; i <= 24; i++) {
  if(i % 9 < 7 && has[i] >= 1 && has[i+1] >= 1 && has[i+2] >= 1) {
   if(num == 3)
    return 1;
   has[i]--; has[i+1]--; has[i+2]--;
   if(search(num+1))
    return 1;
   has[i]++; has[i+1]++; has[i+2]++;
  }
 }
 return 0;
}

int check() {
 for(int i = 0 ; i < 34; i++) {
  if(has[i] >= 2) {
   has[i] -= 2;
   if(search(0))
    return 1;
   has[i] += 2;
  }
 }
 return 0;
}
int main() {
 int cas = 0;
 int ok;
 char str[100];
 int mj[15];
 
 while(scanf("%s", str) == 1) {
  int i, j;
  if(str[0] == '0')
   break;
  mj[0] = convert(str);
  for(i = 1; i < 13; i++) {
   scanf("%s", str);
   mj[i] = convert(str);
  }
  
  printf("Case %d:", ++cas);
  ok = 0;
  //针对每个麻将枚举
  for(i = 0; i < 34; i++) {
   memset(has, 0, sizeof(has));
   for(j = 0; j < 13; j++)
    has[mj[j]]++;
   //该牌最多4张, 如果当前有4张了, 那么明显i麻将是不能加入的, 故continue;
   if(has[i] >= 4)
    continue;
   has[i]++;
   if(check()) {
    ok = 1;
    printf(" %s", majiang[i]);
   }
   has[i]--;
  }
  if(ok == 0)
   printf(" Not ready");
  printf("\n");
 }
 return 0;
}