题目大意:给出十三张牌的样式,问再加哪一张牌才能胡牌,若都不能胡牌输出 Not ready(麻将胡牌是以3+3+3+3+2=14的形式组成 其中‘2’由两张相同的牌组成,称之为“将”,‘3’由三张相同类型的顺子或者三张相同的牌组成,称之为“刻子”,也就是说胡牌由一组奖牌四个刻子组成)
思路:由于只缺一张牌,那么对这张牌进行逐个枚举,然后先检查将牌之后对刻子用dfs进行检查。这里的储存也有些小技巧,详见代码
#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<map>
#include<cstring>
#include<string>
#include<set>
#include<queue>
#include<stack>
#define ll long long
using namespace std;
string majiang[100]={"1T","2T","3T","4T","5T","6T","7T","8T","9T","1W","2W","3W","4W","5W","6W","7W","8W","9W","1S","2S","3S","4S","5S","6S","7S","8S","9S","DONG","NAN","XI","BEI","ZHONG","FA","BAI"};
string str;
int change(string str){
for(int i=0;i<34;i++){
if(majiang[i]==str)return i;
}
return 0;
}
int num[20],zh[50];
bool dfs(int depth){//检查刻子
if(depth==4)return true;
for(int i=0;i<34;i++){
if(zh[i]>=3){
zh[i]-=3;
if(dfs(depth+1))return true;
zh[i]+=3;
}
}
for(int i=0;i<27;i++){
if(i%9<7){
if(zh[i]&&zh[i+1]&&zh[i+2]){
zh[i]--;zh[i+1]--;zh[i+2]--;
if(dfs(depth+1)) return true;
zh[i]++;zh[i+1]++;zh[i+2]++;
}
}
}
return false;
}
bool check(){
for(int i=0;i<34;i++){
if(zh[i]>=2){
zh[i]-=2;//检查将牌,并除去
if(dfs(0))return true;
zh[i]+=2;
}
}
return false;
}
int main(){
int flag,cnt=1;;
while(1){
flag=0;
printf("Case %d:",cnt++);
memset(num,0,sizeof(num));
for(int i=0;i<13;i++){
cin>>str;
if(str[0]=='0')return 0;;
num[i]=change(str);//储存每张牌所对应的编号
}
for(int i=0;i<34;i++){
memset(zh,0,sizeof(zh));
for(int i=0;i<13;i++){
zh[num[i]]++;//记录每一种牌的个数
}
if(zh[i]==4)continue;
zh[i]++;
if(check()){
flag=1;
cout<<' '<<majiang[i];
}
}
if(flag)cout<<endl;
else cout<<" Not ready"<<endl;
}
return 0;
}