PAT-1018 锤子剪刀布

最新推荐文章于 2024-07-25 08:39:03 发布

wjzz

最新推荐文章于 2024-07-25 08:39:03 发布

阅读量351

点赞数 1

分类专栏： PAT

本文链接：https://blog.csdn.net/WeiJJ6608/article/details/50733084

版权

PAT 专栏收录该内容

78 篇文章 0 订阅

订阅专栏

注意：没有胜利的时候最后输出B。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <iomanip>
using namespace std;

#define MAX 100000+5
char a[MAX], b[MAX];
int A[10], B[10];
int main()
{
    //freopen("in.txt", "r", stdin);
    //freopen("out.txt", "w", stdout);
    int n = 0;
    int a1 = 0, a2 = 0, a3 = 0, b1 = 0, b2 = 0, b3 = 0;
    cin >> n;
    for (int i = 0; i < n; i++)
    {
        cin >> a[i] >> b[i];
        if ((a[i] == 'C' && b[i] == 'J') || (a[i] == 'J' && b[i] == 'B') || (a[i] == 'B' && b[i] == 'C'))
        {
            a1++,b3++;
            if (a[i] == 'B')
                A['B'-'A']++;
            else if (a[i] == 'C')
                A['C'-'A']++;
            else if (a[i] == 'J')
                A['J'-'A']++;
        }
        else if ((a[i] == 'C' && b[i] == 'B') || (a[i] == 'J' && b[i] == 'C') || (a[i] == 'B' && b[i] == 'J'))
        {
            a3++,b1++;
            if (b[i] == 'B')
                B['B'-'A']++;
            else if (b[i] == 'C')
                B['C'-'A']++;
            else if (b[i] == 'J')
                B['J'-'A']++;
        }
        else
        {
            a2++,b2++;
        }
    }

    cout << a1 << " " << a2 << " " << a3 << endl;
    cout << b1 << " " << b2 << " " << b3 << endl;
    int max_a = 0, max_b = 0;
    char ca='B', cb='B';
    for (int i = 0; i < 10; i++)
    {
        if (A[i] > max_a)
        {
            max_a = A[i];
            ca = i+'A';
        }
        if (B[i] > max_b)
        {
            max_b = B[i];
            cb = i+'A';
        }
    }
    cout << ca << " " << cb;
    return 0;
}