ZOJ 1111 Poker Hands

题目链接：http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=1111

A poker hand consists of 5 cards dealt from the deck. Poker hands are ranked by the following partial order from lowest to highest

• High Card. Hands which do not fit any higher category are ranked by the value of their highest card. If the highest cards have the same value, the hands are ranked by the next highest, and so on.
• Pair. 2 of the 5 cards in the hand have the same value. Hands which both contain a pair are ranked by the value of the cards forming the pair. If these values are the same, the hands are ranked by the values of the cards not forming the pair, in decreasing order.
• Two Pairs. The hand contains 2 different pairs. Hands which both contain 2 pairs are ranked by the value of their highest pair. Hands with the same highest pair are ranked by the value of their other pair. If these values are the same the hands are ranked by the value of the remaining card.
• Three of a Kind. Three of the cards in the hand have the same value. Hands which both contain three of a kind are ranked by the value of the 3 cards.
• Straight. Hand contains 5 cards with consecutive values. Hands which both contain a straight are ranked by their highest card.
• Flush. Hand contains 5 cards of the same suit. Hands which are both flushes are ranked using the rules for High Card.
• Full House. 3 cards of the same value, with the remaining 2 cards forming a pair. Ranked by the value of the 3 cards.
• Four of a kind. 4 cards with the same value. Ranked by the value of the 4 cards.
• Straight flush. 5 cards of the same suit with consecutive values. Ranked by the highest card in the hand.

Your job is to compare several pairs of poker hands and to indicate which, if either, has a higher rank. 

题意：两手扑克牌，一手各5张牌，按照接下来的规则比大小。下面的规则是按照一手牌从大到小介绍的。

　　规则一：5张牌花色一样，大小连着的，俗称“同花顺”。同花顺的大小根据最大值的判断。

　　规则二：有4张牌一样大的。就是说5张牌中能组成炸弹。这样的牌通过那4张牌的大小再来进行比较大小。比如（A，3，3，3，3）和（9，4，4，4，4）就是后者大。

　　规则三：3张牌一样大，另外两张牌组成一对。满足规则三的两手牌根据那3张牌再进行大小比较。

　　规则四：5张牌同色，大小比较就看牌的大小了。

　　规则五：5张牌大小连着组成了顺子，大小看最大值。

　　规则六：3张牌相同，大小看3张牌的值的大小。

　　规则七：组成两对和一张单牌，大小看那两对的大小，如果还相同的就看那单牌。

　　规则八：组成一队，大小先看这一对，然后再比较剩下的三张散牌。

　　规则九：5张牌没什么组合的，散牌，就单纯的比较大小。

解法：按照这几个规则模拟即可。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<algorithm>
using namespace std;
struct node
{
    int value;
    char color;
    friend bool operator <(node a,node b)
    {
        return a.value > b.value;
    }
}an[6],bn[6];
int cmp(int i,int j) {return i<j; }
int getvalue(char *str)
{
    if (str[0]>='2'&&str[0]<='9') return str[0]-'0';
    if (str[0]=='T') return 10;
    if (str[0]=='J') return 11;
    if (str[0]=='Q') return 12;
    if (str[0]=='K') return 13;
    if (str[0]=='A') return 14;
}
int color_ok(node *cn,int k)
{
    int flag=1;
    for (int i=2 ;i<=5 ;i++) if (cn[i].color!=cn[1].color) flag=0;
    for (int i=1 ;i<=4 ;i++) if (cn[i].value!=cn[i+1].value+1) flag=0;
    if (cn[1].value!=k) flag=0;
    if (flag) return 1;
    return 0;
}
int four_ok(node *cn,int k)
{
    int cnt=0;
    for (int i=1 ;i<=5 ;i++) if (cn[i].value==k) cnt++;
    if (cnt==4) return 1;
    return 0;
}
int full_ok(node *cn,int k)
{
    int cnt=0;
    int u=0,v=0;
    for (int i=1 ;i<=5 ;i++)
    {
        if (cn[i].value==k) cnt++;
        else if (!u) u=i;
        else v=i;
    }
    if (cnt==3)
    {
        if (cn[u].value==cn[v].value) return 1;
        else return 0;
    }
    else return 0;
}
int same_color(node *cn)
{
    for (int i=2 ;i<=5 ;i++) if (cn[i].color!=cn[1].color) return 0;
    return 1;
}
int straight_ok(node *cn,int k)
{
    int flag=0;
    for (int i=1 ;i<=4 ;i++) if (cn[i].value!=cn[i+1].value+1) flag=1;
    if (cn[1].value!=k) flag=1;
    if (flag) return 0;
    return 1;
}
int three_ok(node *cn,int k)
{
    int cnt=0;
    for (int i=1 ;i<=5 ;i++) if (cn[i].value==k) cnt++;
    if (cnt==3) return 1;
    return 0;
}
int first_ok(node *cn,int k)
{
    int cnt=0;
    for (int i=1 ;i<=5 ;i++) if (cn[i].value==k) cnt++;
    if (cnt==2) return 1;
    return 0;
}
int main()
{
    char str[4];
    while (scanf("%s",str)!=EOF)
    {
        an[1].value=getvalue(str);an[1].color=str[1];
        for (int i=2 ;i<=5 ;i++)
        {
            scanf("%s",str);
            an[i].value=getvalue(str);
            an[i].color=str[1];
        }
        for (int i=1 ;i<=5 ;i++)
        {
            scanf("%s",str);
            bn[i].value=getvalue(str);
            bn[i].color=str[1];
        }
        sort(an+1,an+5+1);sort(bn+1,bn+5+1);
        int OK=0;
        int flag1=0,flag2=0;
        ///Straight flush
        for (int i=14 ;i>=6 ;i--)
        {
            flag1=flag2=0;
            if (color_ok(an,i)) flag1=1;
            if (color_ok(bn,i)) flag2=1;
            if (flag1 && flag2) {printf("Tie.
");OK=1;break; }
            if (flag1) {printf("Black wins.
");OK=1;break; }
            if (flag2) {printf("White wins.
");OK=1;break; }
        }
        if (OK) continue;
        ///Four of a kind
        for (int i=14 ;i>=2 ;i--)
        {
            flag1=flag2=0;
            if (four_ok(an,i)) flag1=1;
            if (four_ok(bn,i)) flag2=1;
            if (flag1 && flag2) {printf("Tie.
");OK=1;break; }
            if (flag1) {printf("Black wins.
");OK=1;break; }
            if (flag2) {printf("White wins.
");OK=1;break; }
        }
        if (OK) continue;
        ///Full House
        for (int i=14 ;i>=2 ;i--)
        {
            flag1=flag2=0;
            if (full_ok(an,i)) flag1=1;
            if (full_ok(bn,i)) flag2=1;
            if (flag1 && flag2) {printf("Tie.
");OK=1;break; }
            if (flag1) {printf("Black wins.
");OK=1;break; }
            if (flag2) {printf("White wins.
");OK=1;break; }
        }
        if (OK) continue;
        ///Flush
        flag1=flag2=0;
        if (same_color(an)) flag1=1;
        if (same_color(bn)) flag2=1;
        if (flag1 && flag2)
        {
            int ok=0;
            for (int i=1 ;i<=5 ;i++)
            {
                if (an[i].value>bn[i].value) {printf("Black wins.
");ok=1;OK=1;break; }
                else if (an[i].value<bn[i].value) {printf("White wins.
");ok=1;OK=1;break; }
            }
            if (!ok) {printf("Tie.
");OK=1;continue;}
        }
        if (flag1&&!OK) {printf("Black wins.
");OK=1;continue; }
        if (flag2&&!OK) {printf("White wins.
");OK=1;continue; }
        if (OK) continue;
        ///Straight
        for (int i=14 ;i>=6 ;i--)
        {
            flag1=flag2=0;
            if (straight_ok(an,i)) flag1=1;
            if (straight_ok(bn,i)) flag2=1;
            if (flag1 && flag2) {printf("Tie.
");OK=1;break; }
            if (flag1) {printf("Black wins.
");OK=1;break; }
            if (flag2) {printf("White wins.
");OK=1;break; }
        }
        if (OK) continue;
        ///Three of a Kind
        for (int i=14 ;i>=2 ;i--)
        {
            flag1=flag2=0;
            if (three_ok(an,i)) flag1=1;
            if (three_ok(bn,i)) flag2=1;
            if (flag1 && flag2) {printf("Tie.
");OK=1;break; }
            if (flag1) {printf("Black wins.
");OK=1;break; }
            if (flag2) {printf("White wins.
");OK=1;break; }
        }
        if (OK) continue;
        ///Two Pairs
        for (int i=14 ;i>=2 ;i--)
        {
            flag1=flag2=0;
            int k1=0,k2=0;
            if (first_ok(an,i))
            {
                for (int j=i-1 ;j>=2 ;j--)
                {
                    if (first_ok(an,j)) {flag1=1;k1=j;break;}
                }
            }
            if (first_ok(bn,i))
            {
                for (int j=i-1 ;j>=2 ;j--)
                {
                    if (first_ok(bn,j)) {flag2=1;k2=j;break;}
                }
            }
            if (flag1 && flag2 && k1==k2)
            {
                int u=0,v=0;
                for (int j=1 ;j<=5 ;j++) if (an[j].value!=i && an[j].value!=k1) {u=j;break; }
                for (int j=1 ;j<=5 ;j++) if (bn[j].value!=i && bn[j].value!=k2) {v=j;break; }
                if (an[u].value==bn[v].value) {printf("Tie.
");OK=1;break; }
                else if (an[u].value>bn[v].value) {printf("Black wins.
");OK=1;break; }
                else {printf("White wins.
");OK=1;break; }
            }
            if (flag1 && flag2 && !OK && k1!=k2)
            {
                if (k1>k2) {printf("Black wins.
");OK=1;break; }
                else {printf("White wins.
");OK=1;break; }
            }
            if (flag1) {printf("Black wins.
");OK=1;break; }
            if (flag2) {printf("White wins.
");OK=1;break; }
        }
        if (OK) continue;
        ///Pair
        for (int i=14 ;i>=2 ;i--)
        {
            flag1=flag2=0;
            if (first_ok(an,i)) flag1=1;
            if (first_ok(bn,i)) flag2=1;
            if (flag1 && flag2)
            {
                int a[4],b[4];
                int c=0,d=0;
                for (int j=1 ;j<=5 ;j++) if (an[j].value!=i) a[c++]=an[j].value;
                for (int j=1 ;j<=5 ;j++) if (bn[j].value!=i) b[d++]=bn[j].value;
                sort(a,a+c,cmp);sort(b,b+d,cmp);
                int flag=0;
                for (int j=0 ;j<3 ;j++)
                {
                    if (a[j]>b[j]) {printf("Black wins.
");flag=1;OK=1;break; }
                    else if (a[j]<b[j]) {printf("White wins.
");flag=1;OK=1;break; }
                }
                if (flag==0) {printf("Tie.
");OK=1;break; }
            }
            if (flag1&&!OK) {printf("Black wins.
");OK=1;break; }
            if (flag2&&!OK) {printf("White wins.
");OK=1;break; }
        }
        if (OK) continue;
        ///High Card
        int flag=0;
        for (int i=1 ;i<=5 ;i++)
        {
            if (an[i].value>bn[i].value) {printf("Black wins.
");flag=1;OK=1;break; }
            else if (an[i].value<bn[i].value) {printf("White wins.
");flag=1;OK=1;break; }
        }
        if (!flag) {printf("Tie.
");continue; }
    }
    return 0;
}