暴力 BestCoder Round #41 1001 ZCC loves straight flush

题目传送门

/*
    m数组记录出现的花色和数值，按照数值每5个搜索，看看有几个已满足，剩下 5 - cnt需要替换
    ╰·
*/
#include <cstdio>
#include <algorithm>
#include <iostream>
#include <cstring>
#include <string>
using namespace std;

const int MAXN = 1e4 + 10;
const int INF = 0x3f3f3f3f;

int main(void)        //BestCoder Round #41 1001 ZCC loves straight flush
{
    //freopen ("A.in", "r", stdin);

    int t;
    scanf ("%d", &t);
    while (t--)
    {
        int c[5], d[5], m[5][20];
        memset (m, 0, sizeof (m));
        string s;
        for (int i=0; i<5; ++i)
        {
            cin >> s;    c[i] = s[0] - 'A';
            if (s.size () == 2)    d[i] = s[1] - '0';
            else    d[i] = 10 + s[2] - '0';
            m[c[i]][d[i]]++;
        }
        
        int mn = INF;
        for (int i=0; i<5; ++i)
        {
            int d = c[i];
            for (int j=1; j<=10; ++j)
            {
                int cnt = 0;
                for (int k=j; k<j+5; ++k)
                {
                    int x = k;
                    if (x == 14)    x = 1;
                    if (m[d][x] == 1)    cnt++;
                }
                mn = min (mn, 5 - cnt);
            }
        }

        printf ("%d
", mn);
    }

    return 0;
}