J - Vertical Histogram(1.5.7)

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
代码：

#include <iostream>
#include <cstring>
#include <cstdio>
#include <string>
using namespace std;
int main()
{
    int i,a[26]={0};
    string p1,p;
 for(i=0;i<4;i++)
 {
   
    getline(cin,p);
   
       p1=p1+p;
    }
    int l;
    //l=strlen(p1);
    for(i=0;p1[i]!='\0';i++)
    {
     switch(p1[i])
     {
         case 'A':a[0]++;break;
         case 'B':a[1]++;break;
         case 'C':a[2]++;break;
         case 'D':a[3]++;break;
         case 'E':a[4]++;break;
         case 'F':a[5]++;break;
         case 'G':a[6]++;break;
         case 'H':a[7]++;break;
         case 'I':a[8]++;break;
         case 'J':a[9]++;break;
         case 'K':a[10]++;break;
         case 'L':a[11]++;break;
         case 'M':a[12]++;break;
         case 'N':a[13]++;break;
         case 'O':a[14]++;break;
         case 'P':a[15]++;break;
         case 'Q':a[16]++;break;
         case 'R':a[17]++;break;
         case 'S':a[18]++;break;
         case 'T':a[19]++;break;
         case 'U':a[20]++;break;
         case 'V':a[21]++;break;
         case 'W':a[22]++;break;
         case 'X':a[23]++;break;
         case 'Y':a[24]++;break;
         case 'Z':a[25]++;break;
     }
 }
     int lmax=0,j;
     for(j=0;j<26;j++)
     {
         lmax=(lmax>a[j])? lmax:a[j];
     }
     for(i=lmax;i>0;i--)
     {
   
         for(j=0;j<26;j++)
            {
    if(j>0)
    cout<<' ';
               if(a[j]==i)
      {
                a[j]--;
                  cout<<'*';
      }
      else
      cout<<' ';
   }
            cout<<endl;
     }
     for(i=0;i<26;i++)
     {
          cout<<char(i+65);
         if(i<25)
            cout<<' ';
     }
        cout<<endl;
     return 0;
 
}