uva 11210

https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=2151

题意：给你十三张麻将，问你需要哪几张牌就可以胡牌，这个胡牌排除了七小对以及十三幺

胡牌必须要有一个对子加ｎ个顺子或者三张相同的牌（n）可以为０

思路：枚举每一张牌，然后dfs一下看看是否可以胡

dfs我的是枚举每一个对子

#include <stdio.h>
#include <string.h>
#include <string>
#include <map>
#include <iostream>
using namespace std;

map<string,int>s;

string tmp[50]={"0","1S","2S","3S","4S","5S","6S","7S","8S","9S",
"0","1T","2T","3T","4T","5T","6T","7T","8T","9T",
"0","1W","2W","3W","4W","5W","6W","7W","8W","9W",
"0","DONG","NAN","XI","BEI","ZHONG","FA","BAI"};
bool vis[56];
int num[60];

bool dfs(int cnt)
{
    for(int i = 1;i<=37;i++)
    {
        if(num[i]>=3)
        {
            if(cnt==3)
                return true;
            num[i]-=3;
            if(dfs(cnt+1))
                return true;
            num[i]+=3;
        }
    }
    for(int i = 1;i<=27;i++)
    {
        if(i%10!=8&&i%10!=9&&i%10!=0&&num[i]&&num[i+1]&&num[i+2])
        {
            if(cnt==3)  return true;
            num[i]--;
            num[i+1]--;
            num[i+2]--;
            if(dfs(cnt+1))  return true;
            num[i]++;
            num[i+1]++;
            num[i+2]++;
        }
    }
    return false;
}

bool check()
{
    for(int i = 1;i<=37;i++)
    {
        if(num[i]>=2)
        {
            num[i]-=2;
            if(dfs(0))  return true;
            num[i]+=2;
        }
    }
    return false;
}


int main()
{
   // freopen("in.txt","r",stdin);
    int Case = 0;
    for(int i = 0;i<=37;i++)
        s[tmp[i]] = i;
    string str[20];
    while(cin>>str[1]){
        int cnt = 0;
        memset(vis,false,sizeof(vis));
        memset(num,0,sizeof(num));
        if(str[1] == "0")    break;
        for(int i =2;i<=13;i++) cin>>str[i];

        for(int i = 1;i<=37;i++){
        memset(num,0,sizeof(num));
            for(int i = 1;i<=13;i++)
               num[s[str[i]]]++;
                if(i%10!=0&&num[i]!=4){
                    num[i]++;
                    if(check())
                        vis[i] = true,cnt++;
                    num[i]--;
                }
        }
        printf("Case %d:",++Case);

        for(int i = 1;i<=37;i++)
            if(vis[i])  cout<<" "<<tmp[i];
        if(!cnt)
            cout<<" Not ready";
        cout<<endl;
        }
    return 0;
}