【模拟与阅读理解】Gym - 101954C Rullete

http://codeforces.com/gym/101954/problem/C

题意：14行伪代码让你翻译。

坑得yibi

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<algorithm>
#include<iostream>
#include<math.h>
#include<ctime>
#include<string>
#include<vector>
using namespace std;
typedef long long ll;
const int MAXN = 1e5 + ;
const int maxn = MAXN;
const long long MOD = 1e9 + ;
#define rep(i,t,n)  for(int i =(t);i<=(n);++i)
#define per(i,n,t)  for(int i =(n);i>=(t);--i)
#define mmm(a,b) memset(a,b,sizeof(a))
//#define x first
//#define y second

void smain();
#define ONLINE_JUDGE
int main() {

    ios::sync_with_stdio(false);
#ifndef ONLINE_JUDGE
    FILE *myfile;
    myfile = freopen("C:\\Users\\acm-14\\Desktop\\test\\b.in", "r", stdin);
    if (myfile == NULL)
        fprintf(stdout, "error on input freopen\n");
    FILE *outfile;
    outfile = freopen("C:\\Users\\acm-14\\Desktop\\test\\out.txt", "w", stdout);
    if (outfile == NULL)
        fprintf(stdout, "error on output freopen\n");
    long _begin_time = clock();
#endif
    smain();
#ifndef ONLINE_JUDGE
    long _end_time = clock();
    printf("time = %ld ms.", _end_time - _begin_time);
#endif
    return ;
}

string cards[];
int cval[];
char ctyp[];
string crk[];
int typ[];
/*2D 5D JD KC AC*/
int score = ;
int cntmod = ;
void fff(int x) {
    if (x == ) {
        score++;
        int tmp = ;
        rep(i, , )if (crk[i] == "J")tmp++;
        score += tmp * cval[];
    }
    if (x == ) {
        //int last = score;
        rep(i, , ) {
            typ[ctyp[i]]++;
        }
        rep(i, , )if (typ[i] >= ) { score *= ; break; }
        //if (last != score)cntmod++, lastmod = 2;
    }
    if (x == ) {

        //last = score;
        if (typ['C'] >  && typ['S'] >  && typ['H'] >  && typ['D'] > )score *= ;
        //if (last != score)cntmod++, lastmod = 3;
    }
    if (x == ) {
        //last = score;
        score += abs(typ['C'] + typ['S'] - typ['H'] - typ['D']);
    //    if (last != score)cntmod++, lastmod = 4;
    }
    if (x == ) {
        //last = score;
        if (score %  == ) {
            int t = ;
            rep(i, , score) {
                if (score%i == )t += i;
            }
            score += t;
        }
        //if (last != score)cntmod++, lastmod = 5;
    }//
    if (x == ) {
        //last = score;
        int cnt7 = ;
        rep(i, , )if (cval[i] == )cnt7++;
        if (cnt7 == )score -=  * ;
        //if (last != score)cntmod++, lastmod = 6;
    }
    //
    if (x == ) {
        //last = score;
        if (score >= ) {
            int mn = ;
            rep(i, , )mn = min(mn, cval[i]);
            score += mn;
        }
        //if (last != score)cntmod++, lastmod = 7;
    }//
    if (x == ) {
        //last = score;
        if (score < )score *= -;
        //if (last != score)cntmod++, lastmod = 8;
    }//
    if (x == ) {
        //last = score;
        if (typ['D'] >= ) {
            score += ;
            rep(i, , ) {
                if (cval[i] == )cval[i] = , crk[i] = '';
                else if (cval[i] == )cval[i] = , crk[i] = '';
                else if (cval[i] == )cval[i] = , crk[i] = '';
                else if (cval[i] == )cval[i] = , crk[i] = '';
            }
        }
        //if (last != score)cntmod++, lastmod = 9;
    }//
    if (x == ) {
        //last = score;
        int a[];
        int cnta = ;
        rep(i, , ) {
            if (crk[i] >= ""&&crk[i] <= "")a[i] = crk[i][] - '';
            if (crk[i].length() == )a[i] = ;
            if (crk[i] == "A")a[i] = , cnta++;;
            if (crk[i] == "J")a[i] = ;
            if (crk[i] == "Q")a[i] = ;
            if (crk[i] == "K")a[i] = ;
        }
        sort(a + , a +  + );
        int f = ;
        rep(i, , )if (a[i] != a[i + ] - )f = ;

        if ( f)score += cnta * ;
        //if (last != score)cntmod++, lastmod = 10;
    }//
    if (x == ) {
        //last = score;
        if (cntmod > ) {
            int x = score;
            while (x) {
                score += x & ;
                x >>= ;
            }
            //score += __builtin_popcount(8);
        }
        //if (last != score)cntmod++, lastmod = 11;
    }
}
void smain()
{
    rep(i, , ) {
        cin >> cards[i];
        if (cards[i][] >= ''&&cards[i][] <= '')cval[i] = cards[i][] - '';
        else cval[i] = ;
        if (cards[i].length() == )cval[i] = , ctyp[i] = cards[i][],crk[i]="";
        else ctyp[i] = cards[i][],crk[i]=cards[i][];

    }

    rep(i, , )score += cval[i];

    int lastmod = ;
    //
    score++; cntmod++;
    int tmp = ;
    rep(i, , )if (crk[i] == "J")tmp++;
    score += tmp * cval[];
    //
    int last = score;
    rep(i, , ) {
        typ[ctyp[i]]++;
    }
    rep(i, , )if (typ[i] >= ) { score *= ; break; }
    if (last != score)cntmod++, lastmod = ;
    //
    last = score;
    if (typ['C'] >  && typ['S'] >  && typ['H'] >  && typ['D'] > )score *= ;
    if (last != score)cntmod++, lastmod = ;
    //
    last = score;
    score += abs(typ['C'] + typ['S'] - typ['H'] - typ['D']);
    if (last != score)cntmod++,lastmod = ;
    //
    last = score;
    if (score %  == ) {
        int t = ;
        rep(i, , score) {
            if (score%i == )t += i;
        }
        score += t;
    }
    if (last != score)cntmod++, lastmod = ;
    //
    last = score;
    int cnt7 = ;
    rep(i, , )if (cval[i] == )cnt7++;
    if (cnt7 == )score -=  * ;
    if (last != score)cntmod++, lastmod = ;
    //
    last = score;
    if (score >= ) {
        int mn = ;
        rep(i, , )mn = min(mn, cval[i]);
        score += mn;
    }
    if (last != score)cntmod++, lastmod = ;
    //
    last = score;
    if (score < )score *= -;
    if (last != score)cntmod++, lastmod = ;
    //
    last = score;
    if (typ['D'] >= ) {
        score += ;
        rep(i, , ) {
            if (cval[i] == )cval[i] = , crk[i] = "";
            else if (cval[i] == )cval[i] = , crk[i] = "";
            else if (cval[i] == )cval[i] = , crk[i] = "";
            else if (cval[i] == )cval[i] = , crk[i] = "";
        }
    }
    if (last != score)cntmod++, lastmod = ;
    //
    last = score;
    int a[];
    int cnta=;
    rep(i, , ) {
        if (crk[i] >= ""&&crk[i] <= "")a[i] = crk[i][] - '';
         if (crk[i].length() == )a[i] = ;
         if (crk[i] == "A")a[i] = , cnta++;;
         if (crk[i] == "J")a[i] = ;
         if (crk[i] == "Q")a[i] = ;
         if (crk[i] == "K")a[i] = ;
    }
    sort(a + , a +  + );
    int f = ;
    rep(i, , )if (a[i] != a[i + ] - )f = ;

    if (f)score += cnta * ;
    if (last != score)cntmod++, lastmod = ;
    //
    last = score;
    if (cntmod > ) {
        int x = score;
        while (x) {
            score += x & ;
            x >>= ;
        }
        //score += __builtin_popcount(8);
    }
    if (last != score)cntmod++, lastmod = ;
    //
    rep(i, , ) {
        if (cval[i] == ) {
            fff(lastmod);
            break;
        }
    }
    //
    rep(i, , ) {
        if (cval[i] == ) {
            if(score>=) { score *= ; break; }

        }
    }
    cout << score << endl;

    //int n;
    //cin >> n;
}
/*,
o:o
:o:
o:o
33333333333
QC 8D JD 10S 9D
2D 5D JD KC AC
*/