P1598垂直柱状图

#include
#include
#include 
#include
#include
using namespace std;

int main()
{
	
	string a,b,c,d;
	getline(cin, a);
	getline(cin, b);
	getline(cin, c);
	getline(cin, d);
	int A[30] = {0};//存放字母出现的次数
	for (int i = 0; i < a.size(); i++)
	{
		if (a[i] >= 'A'&&a[i] <= 'Z')//用字母的顺序做数组下标
		{
			A[a[i] - '@']++;
		}
	}
	for (int j = 0; j < b.size(); j++)
	{
		if (b[j] >= 'A'&&b[j] <= 'Z')
		{
			A[b[j] - '@']++;
		}
	}
	for (int k = 0; k< c.size(); k++)
	{
		if (c[k] >= 'A'&&c[k] <= 'Z')
		{
			A[c[k] - '@']++;
		}
	}
	for (int m = 0; m < d.size(); m++)
	{
		if (d[m] >= 'A'&&d[m] <= 'Z')
		{
			A[d[m] - '@']++;
		}
	}
	
	int max = A[0];
	for (int n = 1; n <= 26; n++)//找出字母出现最多字数的那个，可以确定行
	{
		if (A[n] >= max)
			max = A[n];
	}
	int temp = max;
	for (int q = 1; q <= max; q++)//比最多次数小的就不输出，等于最多次数的就输出
	{
		for (int p = 1; p <= 25; p++)
		{
			if (A[p] < temp)
				cout << "  ";
			else
				cout << "* ";
		}
		if (A[26] < temp)
			cout << "  ";
		else
			cout << "*";
		temp--;//最大次数每输完一行要减1
		cout << endl;
	}
	cout << "A B C D E F G H I J K L M N O P Q R S T U V W X Y Z";
		return 0;

}