//1_5_7: Vertical Histogram 统计字符个数并输出 POJ2136
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int main()
{
int i,j,max,let[26] = {0};
char str[80],letter;
for(i = 0;i < 4;i ++)
{
gets(str);
j = 0;
while(str[j])
{
if(str[j] >= 'A' && str[j] <= 'Z') let[(int)(str[j] - 'A')]++;
j ++;
}
}
max = 0;
for(i = 0;i < 26;i ++) if(let[i] > max) max = let[i];
for(i = 0;i < max;i ++)
{
for(j = 0;j < 25;j ++)
{
if(let[j] >= max - i) printf("* ");
else printf(" ");
}
if(let[25] >= max - i) printf("*");
else printf(" ");
printf("\n");
}
letter = 'A';
for(i = 0;i < 25;i ++)
{
printf("%c ",letter);
letter ++;
}
printf("Z\n");
return 0;
}
/*测试结果:通过POJ2136检测
THE QUICK BROWN FOX JUMPED OVER THE LAZY DOG.
THIS IS AN EXAMPLE TO TEST FOR YOUR
HISTOGRAM PROGRAM.
HELLO!
*
*
* *
* * * *
* * * *
* * * * * *
* * * * * * * * * *
* * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * * * * * * * *
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
请按任意键继续. . .
*/
POJ2136 Vertical Histogram
最新推荐文章于 2017-04-19 08:55:12 发布