ACM学习历程—Hihocoder 1177 顺子(模拟 && 排序 && gcd)（hihoCoder挑战赛12）

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <string>
#define LL long long

using namespace std;

struct Card
{
    int num;
    char kind;
};

bool cmp(Card a, Card b)
{
    return a.num < b.num;
}

struct node
{
    Card card[5];
}my;

int ans;

//GCD
//求最大公约数
//O(logn)
int gcd(int a, int b)
{
    if (b == 0)
        return a;
    else
        return gcd(b, a%b);
}

bool input()
{
    char str[5];
    for (int i = 0; i < 4; ++i)
    {
        if (scanf("%s", str) == EOF)
            return false;
        if (strlen(str) == 2)
        {
            if (‘2‘ <= str[0] && str[0] <= ‘9‘)
                my.card[i].num = str[0] - ‘0‘;
            else if (str[0] == ‘A‘)
                my.card[i].num = 1;
            else if (str[0] == ‘J‘)
                my.card[i].num = 11;
            else if (str[0] == ‘Q‘)
                my.card[i].num = 12;
            else if (str[0] == ‘K‘)
                my.card[i].num = 13;
            my.card[i].kind = str[1];
        }
        else
        {
            my.card[i].num = 10;
            my.card[i].kind = str[2];
        }
    }
    return true;
}

bool judge(node t)
{
    if (t.card[0].kind == t.card[1].kind &&
        t.card[1].kind == t.card[2].kind &&
        t.card[2].kind == t.card[3].kind &&
        t.card[3].kind == t.card[4].kind)
        return false;
    sort(t.card, t.card+5, cmp);
    if (t.card[0].num+1 == t.card[1].num &&
        t.card[1].num+1 == t.card[2].num &&
        t.card[2].num+1 == t.card[3].num &&
        t.card[3].num+1 == t.card[4].num)
        return true;
    if (t.card[0].num == 1 &&
        t.card[1].num+1 == t.card[2].num &&
        t.card[2].num+1 == t.card[3].num &&
        t.card[3].num+1 == t.card[4].num &&
        t.card[4].num == 13)
        return true;
    return false;
}

void work()
{
    ans = 0;
    for (int i = 1; i <= 13; ++i)
    {
        my.card[4].num = i;
        my.card[4].kind = ‘S‘;
        ans += judge(my);
        my.card[4].kind = ‘H‘;
        ans += judge(my);
        my.card[4].kind = ‘C‘;
        ans += judge(my);
        my.card[4].kind = ‘D‘;
        ans += judge(my);
    }
    int d = gcd(ans, 48);
    if (ans == 0)
        printf("0/1\n");
    else
        printf("%d/%d\n", ans/d, 48/d);
}

int main()
{
    //freopen("test.in", "r", stdin);
    while (input())
    {
        work();
    }
    return 0;
}