poj_2136

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
using namespace std;
int main()
{
	int len,i,j,maxhigh=0;
	string s;
	int c[26];
	memset(c,0,sizeof(c));
	while (cin>>s)
	{
		len=s.length();
		for(i=0;i<len;i++)
			if(s[i]>=65 && s[i]<=90)
				++c[s[i]-'A'];
	}
	for(i=0;i<26;i++)
		if(maxhigh<c[i])
			maxhigh=c[i];
//当做矩阵输出方式即可 
	for(i=maxhigh;i>0;i--)
	{
		for(j=0;j<26;j++)
			if(c[j]>=i)
				printf("* ");
			else
				printf("  ");
		printf("\n");
	}
	for(i=0;i<26;i++)
	{
		if(i>0)
			printf(" ");
		printf("%c",i+'A');
	}
	printf("\n");
	return 0;
}