PAT 1018 锤子剪刀布 (20 分)

Python ml

于 2021-12-30 17:12:59 发布

阅读量97

点赞数

分类专栏： pta 文章标签：机器学习算法动态规划

本文链接：https://blog.csdn.net/m0_48711099/article/details/122241515

版权

游戏策略 BCJ 胜率分析算法统计 C++编程

关键词由CSDN通过智能技术生成

pta 专栏收录该内容

140 篇文章 1 订阅

订阅专栏

#include <iostream>
using namespace std;
int main() {
   int n;
   string a,b;
   cin>>n;
   int jiawin=0,yiwin=0;
   int jia[3]={0}, yi[3] = {0};
    for(int i=0;i<n;i++){
        cin>>a>>b;
        if(a=="B"&&b=="C"){
            jiawin++;
            jia[0]++;
        }else if (a=="B"&&b=="J") {
            yiwin++;
            yi[2]++;
        } else if (a=="C"&&b=="B") {
            yiwin++;
            yi[0]++;
        } else if (a=="C"&&b=="J") {
            jiawin++;
            jia[1]++;
        } else if (a=="J"&&b=="B") {
            jiawin++;
            jia[2]++;
        } else if (a=="J"&&b=="C") {
            yiwin++;
            yi[1]++;
        }
    }
    cout << jiawin << " " << n - jiawin - yiwin << " " << yiwin << endl << yiwin << " " << n - jiawin - yiwin << " " << jiawin << endl;
    int maxjia = jia[0] >= jia[1] ? 0 : 1;
    maxjia = jia[maxjia] >= jia[2] ? maxjia : 2;
    int maxyi = yi[0] >= yi[1] ? 0 : 1;
    maxyi = yi[maxyi] >= yi[2] ? maxyi : 2;
    char str[4] = {"BCJ"};
    cout << str[maxjia] << " " << str[maxyi];
    system("pause");
    return 0;
}