UVa 11210 - Chinese Mahjong(中国麻将)
来源:互联网 发布:linux 内核调试 编辑:程序博客网 时间:2024/05/03 16:30
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 FA1S 2S 3S 4S 5S 6S 7S 8S 9S 1T 3T 5T 7T0
Output for the Sample Input
Case 1: 1S 4S FACase 2: Not ready
1 #include<cstdio> 2 #include<string.h> 3 #include<cstdlib> 4 using namespace std; 5 6 char *mahjong[] = {"1T","2T","3T","4T","5T","6T","7T","8T","9T", 7 "1S","2S","3S","4S","5S","6S","7S","8S","9S", 8 "1W","2W","3W","4W","5W","6W","7W","8W","9W", 9 "DONG","NAN","XI","BEI",10 "ZHONG","FA","BAI"};11 int num[34];12 int convert(char *s)13 {14 for(int i = 0; i < 34; i++)15 {16 if(!strcmp(s , mahjong[i])) return i;17 }18 return -1;19 }20 bool search(int depth)21 {22 int i;23 for(i = 0; i < 34; i++)24 {25 if(num[i] >= 3) //刻子26 {27 if(depth == 3) return true; //放在这里,可以节约时间28 num[i] -= 3;29 if(search(depth + 1)) return true;30 num[i] += 3;31 }32 }33 for(i = 0; i < 25; i++)34 {35 if(i % 9 < 7 && num[i] >= 1 && num[i+1] >= 1 && num[i+2] >=1) //顺子36 {37 if(depth == 3) return true;38 num[i]--;39 num[i+1]--;40 num[i+2]--;41 if(search(depth + 1)) return true;42 num[i]++;43 num[i+1]++;44 num[i+2]++;45 }46 }47 return false;48 }49 bool check()50 {51 int i;52 for(i = 0; i < 34; i++)53 {54 if(num[i] >= 2) //将55 {56 num[i] -= 2;57 if(search(0)) return true;58 num[i] += 2;59 }60 }61 return false;62 }63 int main()64 {65 char st[100];66 int i , j , count = 1;67 int temp[15];68 bool OK;69 while(scanf("%s" , st) == 1)70 {71 if(st[0] == '0') break;72 temp[0] = convert(st);73 for(i = 1; i < 13; i++)74 {75 scanf("%s" , &st);76 temp[i] = convert(st);77 }78 OK = false;79 printf("Case %d:" , count++);80 for(i = 0; i < 34; i++)81 {82 memset(num , 0 , sizeof(num));83 for(j = 0; j < 13; j++)84 {85 num[temp[j]]++;86 }87 if(num[i] >= 4) continue; //此种类已满4个,不能再加88 num[i]++;89 if(check())90 {91 printf(" %s" , mahjong[i]);92 OK = true;93 }94 }95 if(!OK) printf(" Not ready");96 printf("\n");97 }98 return 0;99 }
- UVa 11210 - Chinese Mahjong(中国麻将)
- UVA 11210 Chinese Mahjong(中国麻将 , 大模拟)
- 中国麻将(Chinese Mahjong, UVa 11210)【JAVA算法实现】
- uva 11210 Chinese Mahjong 中国麻将 dfs回溯
- UVa 11210 Chinee Mahjong 中国麻将
- hdu 4431 Mahjong,uva 11210 chinese Mahjong,麻将,超快的解法。。
- uva 11210 Chinese Mahjong
- Uva-11210-Chinese Mahjong
- uva 11210 - Chinese Mahjong
- Uva 11210 Chinese Mahjong
- UVA 11210 Chinese Mahjong
- UVA 11210 Chinese Mahjong
- UVA 11210 Chinese Mahjong
- UVA - 11210 Chinese Mahjong
- UVA-11210-Chinese Mahjong
- UVA 11210 Chinese Mahjong
- UVA 11210 - Chinese Mahjong
- Uva 11210 - Chinese Mahjong
- 2013第四届 蓝桥杯c/c++B组预赛 解题报告
- UVa 11292 Dragon of Loowater
- UVa11729 Commando War(突击战)
- UVa11300 - Spreading the Wealth (分金币)
- UVa 11384 - Help is needed for Dexter (正整数序列)
- UVa 11210 - Chinese Mahjong(中国麻将)
- UVa 11462 - Age Sort (桶排序)
- UVa 11520 - Fill the Square (填充正方形)
- UVa 11078 - Open Credit System(开放式学分制)
- 怎么样将数据库的表在Java中界面中显示出来
- JAVA与 SQL server2008进行连接
- JAVA:对数据库的一系列操作代码
- ERROR:通过端口 1433 连接到主机 localhost 的 TCP/IP 连接失败。错误:“Connection refused: connect。请验证连接属性,并检查 SQL Server 的实例正在主机上运行,且在此端口接受 TCP/IP 连
- 分析成绩单