占卜DIY

 

 

#include <bits/stdc++.h>
using namespace std;
const int N = 14;
vector<int> cards[N]; //1~13,vector存储初始正面朝下着的牌的情况
int open[N]; //正面朝上只需要存储每一堆的个数
int get(string c) {
    if (c[0] == 'A') {
        return 1;
    }
    if (c[0] >= '2' && c[0] <= '9') {
        return c[0] - '0';
    }
    if (c[0] == '0') {
        return 10;
    }
    if (c[0] == 'J') {
        return 11;
    }
    if (c[0] == 'Q') {
        return 12;
    }
    return 13;
}
int main() {
    for (int i = 1; i <= 13; i++) {
        for (int j = 1; j <= 4; j++) {
            string t;
            cin >> t;
            cards[i].push_back(get(t)); //每堆下标为0的是从上往下的第一张
        }
    }
    for (int i = 0; i < 4; i++) { //循环4次
        int t = cards[13][i]; //取出第13堆的牌，0~4依次是从上往下第1~4张
        while (t != 13) {
            open[t]++; //把抽出的牌放在第t堆上
            int r = cards[t].back(); //再找到第t堆的最下面一个元素
            cards[t].pop_back();
            t = r;
        }
    }
    int res = 0;
    for (int i = 1; i <= 12; i++) {
        if (open[i] == 4) {
            res++;
        }
    }
    cout << res << endl;
    return 0;
}