暴力 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 + ;
 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[], d[], m[][];
         memset (m, , sizeof (m));
         string s;
         for (int i=; i<; ++i)
         {
             cin >> s;    c[i] = s[] - 'A';
             if (s.size () == )    d[i] = s[] - '';
             else    d[i] =  + s[] - '';
             m[c[i]][d[i]]++;
         }

         int mn = INF;
         for (int i=; i<; ++i)
         {
             int d = c[i];
             for (int j=; j<=; ++j)
             {
                 int cnt = ;
                 for (int k=j; k<j+; ++k)
                 {
                     int x = k;
                     if (x == )    x = ;
                     if (m[d][x] == )    cnt++;
                 }
                 mn = min (mn,  - cnt);
             }
         }

         printf ("%d\n", mn);
     }

     return ;
 }