PAT乙级1018

最新推荐文章于 2021-12-08 01:32:42 发布

DoctorLDQ

最新推荐文章于 2021-12-08 01:32:42 发布

阅读量279

点赞数

分类专栏： PAT乙级文章标签： PAT

本文链接：https://blog.csdn.net/DoctorLDQ/article/details/86357059

版权

PAT乙级专栏收录该内容

90 篇文章 1 订阅

订阅专栏

#include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;

//a 石头C b 剪刀J c 布B
char maxChar(int a, int b, int c)
{
	if ((a > b&&a > c) || (a == b && a>c))
		return 'C';
	else if ((b > a&&b > c))
		return 'J';
	else if ((c > a&&c > b) || (c == a&&c > b) || (c == b&&c > a))
		return 'B';
}
int main(int argc, char* argv[])
{
	int runTime, win = 0, equal = 0, fail = 0;

	int jwc = 0, jwj = 0, jwb = 0;
	int ywc = 0, ywj = 0, ywb = 0;
	char jia, yi;
	cin >> runTime;
	while (runTime--)
	{
		cin >> jia >> yi;
		if ((jia=='C'&&yi=='J')||(jia=='B'&&yi=='C')||(jia=='J'&&yi=='B'))
		{
			win++;
			if (jia == 'C')
				jwc++;
			else if (jia == 'J')
				jwj++;
			else
				jwb++;
			
		}
		else if (jia==yi)
			equal++;
		else
		{
			fail++;
			if (yi == 'C')
				ywc++;
			else if (yi == 'J')
				ywj++;
			else
				ywb++;
		}
	}
	cout << win << " " << equal << " " << fail << endl;
	cout << fail << " " << equal << " " << win << endl;

	char temp1 = maxChar(jwc, jwj, jwb);

	char temp2 = maxChar(ywc, ywj, ywb);
	cout << temp1 << " " << temp2;