POJ-2136 Vertical Histogram

Vertical Histogram
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 17713 Accepted: 8563

Description

Write a program to read four lines of upper case (i.e., all CAPITAL LETTERS) text input (no more than 72 characters per line) from the input file and print a vertical histogram that shows how many times each letter (but not blanks, digits, or punctuation) appears in the all-upper-case input. Format your output exactly as shown.

Input

* Lines 1..4: Four lines of upper case text, no more than 72 characters per line.

Output

* Lines 1..??: Several lines with asterisks and spaces followed by one line with the upper-case alphabet separated by spaces. Do not print unneeded blanks at the end of any line. Do not print any leading blank lines. 

Sample Input

THE QUICK BROWN FOX JUMPED OVER THE LAZY DOG.
THIS IS AN EXAMPLE TO TEST FOR YOUR
HISTOGRAM PROGRAM.
HELLO!

Sample Output

                            *
                            *
        *                   *
        *                   *     *   *
        *                   *     *   *
*       *     *             *     *   *
*       *     * *     * *   *     * * *
*       *   * * *     * *   * *   * * * *
*     * * * * * *     * * * * *   * * * *     * *
* * * * * * * * * * * * * * * * * * * * * * * * * *
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

Source


#include<cstdio>
#include<iostream>
#include<cstring>
using namespace std;

int main()
{
	char w[4][100];
	int a[26];
	memset(w, 0, sizeof(w));
	memset(a, 0, sizeof(a));
	int max = 0;
	gets(w[0]);
	gets(w[1]);
	gets(w[2]);
	gets(w[3]);
	for (int i = 0; i < 4; i++)
	{
		for (int j = 0; j < 100; j++)
		{
			if (w[i][j] >= 'A' && w[i][j] <= 'Z')
			{
				a[w[i][j] - 'A']++;
			}
		}
	}
	for (int i = 0; i < 26; i++)
		if (a[i] > max)
		{
			max = a[i];
		}
	for (int i = 0; i < max; i++)
	{
		for (int j = 0; j < 26; j++)
		{
			if (j == 0)
			{
				if (i + a[j] >= max)
				{
					printf("*");
				}
				else
				{
					printf(" ");
				}
			}
			else
			{
				if (i + a[j] >= max)
				{
					printf(" *");
				}
				else
				{
					printf("  ");
				}
			}
		}
		printf("\n");
	}
	for (int i = 'A'; i <= 'Z'; i++)
	{
		if (i == 'A')
		{
			printf("%c", i);
		}
		else
		{
			printf(" %c", i);
		}
	}
	printf("\n");
	return 0;
}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值