【PAT-B1018】锤子剪刀布 (20分)(c++)

最新推荐文章于 2024-10-18 22:48:33 发布

liyn10

最新推荐文章于 2024-10-18 22:48:33 发布

阅读量59

点赞数

分类专栏： PAT刷题文章标签： c++ leetcode 算法

本文链接：https://blog.csdn.net/weixin_44771252/article/details/109827273

版权

PAT刷题专栏收录该内容

31 篇文章 0 订阅

订阅专栏

1018 锤子剪刀布 (20分)

#include<iostream>
using namespace std;
#include<vector>

int change(char a) {
	if (a == 'B') {
		return 0;
	}
	if (a == 'C') {
		return 1;
	}
	if (a == 'J') {
		return 2;
	}
}
char enchange(int a) {
	if (a == 0) {
		return 'B';
	}
	if (a == 1) {
		return 'C';
	}
	if (a == 2) {
		return 'J';
	}
}

void test()
{
	//初始化,声明
	int n = 0;
	int k1 = 0;
	int k2 = 0;
	int j_value[3] = { 0 }, y_value[3] = { 0 };
	int j_win[3] = { 0 }, y_win[3] = { 0 };
	int hand_A[3] = { 0 };
	int	hand_B[3] = { 0 };

	cin >> n;

	for (int i = 0; i < n; i++)
	{
		char j, y;
		cin >> j;
		cin >> y;
		
		k1 = change(j);
		k2 = change(y);

		//甲赢
		if ((k1 + 1) % 3 == k2) {
			j_value[0]++;
			y_value[2]++;
			hand_A[k1]++;
		}

		//乙赢
		else if ((k2 + 1) % 3 == k1) {
			j_value[2]++;
			y_value[0]++;
			hand_B[k2]++;
		}

		//平局
		else {
			j_value[1]++;
			y_value[1]++;
		}
	}
	//寻找
	int id1 = 0, id2 = 0;
	for (int i = 0; i < 3; i++) {
		if (hand_A[i] > hand_A[id1]) id1 = i;
		if (hand_B[i] > hand_B[id2]) id2 = i;
	}

	//输出
	cout << j_value[0] << " " << j_value[1] << " " << j_value[2] << endl;
	cout << y_value[0] << " " << y_value[1] << " " << y_value[2] << endl;
	cout << enchange(id1) << " " << enchange(id2) << endl;
}


int main()
{
	test();
	return 0;
}