模拟 hihoCoder 1177 顺子

题目传送门

 /*
     模拟：简单的照着规则做就可以了，把各种情况考虑到，虽然比赛写的丑了点，但能1Y还是很开心的:)
 */
 #include <cstdio>
 #include <cstring>
 #include <iostream>
 #include <algorithm>
 #include <cmath>
 using namespace std;

 const int MAXN = 1e2 + ;
 const int INF = 0x3f3f3f3f;
 struct Card
 {
     int v, w;
 }ca[];
 char s[][];

 bool cmp(Card x, Card y)    {return x.v < y.v;}

 int main(void)        //hihoCoder 1177 顺子
 {
     while (scanf ("%s %s %s %s", s[], s[], s[], s[]) == )
     {
         int pre = ;    bool ok = true;
         for (int i=; i<=; ++i)
         {
             int len = strlen (s[i]);
             if (s[i][] == 'A')    ca[i].v = ;
             else if (s[i][] == 'J')    ca[i].v = ;
             else if (s[i][] == 'Q')    ca[i].v = ;
             else if (s[i][] == 'K')    ca[i].v = ;
             else
             {
                 if (len == )    ca[i].v = ;
                 else    ca[i].v = s[i][] - '';
             }
             int p = ;    if (len == )    p = ;
             if (s[i][p] == 'S')    ca[i].w = ;
             else if (s[i][p] == 'H')    ca[i].w = ;
             else if (s[i][p] == 'C')    ca[i].w = ;
             else if (s[i][p] == 'D')    ca[i].w = ;
             if (i == )    pre = ca[].w;
             else
             {
                 if (ca[i].w != pre)    ok = false;        //是否四张牌都相同花色
             }
         }

         sort (ca+, ca++, cmp);
         int flag = ;    bool no = false;
         for (int i=; i<=; ++i)
         {
             if (ca[i].v - ca[i-].v == )    continue;
             else if (ca[i].v - ca[i-].v == )
             {
                 if (!flag)    flag = i;
                 else no = true;
             }
             else    no = true;
         }

         if (no)    puts ("0/1");        //若有来两个地方不是连续的则不可能是顺子
         else
         {
             if (flag)        //如果在中间插入牌
             {
                 if (ok)    {puts ("1/16");}
                 else {puts ("1/12");}
             }
             else        //两侧插牌
             {
                 if (ok)
                 {
                     if (ca[].v ==  || ca[].v == )    puts ("1/16");
                     else    puts ("1/8");
                 }
                 else
                 {
                     if (ca[].v ==  || ca[].v == )    puts ("1/12");
                     else    puts ("1/6");
                 }
             }
         }
     }

     return ;
 }