poj2136

                                                                       Vertical Histogram

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 16999		Accepted: 8238

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

USACO 2003 February Orange

 #include <iostream>
 #include<cstring>
 #include<cstdio>
 #include<iomanip>
 using namespace std;
 int main()
 {
     char str1[],str2[],str3[],str4[];
     while(gets(str1))
     {
         gets(str2);
         gets(str3);
         gets(str4);
         int number[];
         int maxnum=;
         memset(number,,sizeof(number)); //这句话一定要加上去，不要以为定义完数组后就会自动填充为0
         for(int i=;i<strlen(str1);i++)
         {
             if(str1[i]==' '||str1[i]<'A'||str1[i]>'Z')
                 continue;
             int j = (int)str1[i]-;
             number[j]=number[j]+;
             if(number[j]>maxnum)
                 maxnum = number[j];
         }
         for(int i=;i<strlen(str2);i++)
         {
             if(str2[i]==' '||str2[i]<'A'||str2[i]>'Z')
                 continue;
             int j = (int)str2[i]-;
             number[j]++;
             if(number[j]>maxnum)
                 maxnum = number[j];
         }
         for(int i=;i<strlen(str3);i++)
         {
             if(str3[i]==' '||str3[i]<'A'||str3[i]>'Z')
                 continue;
             int j = (int)str3[i]-;
             number[j]++;
             if(number[j]>maxnum)
                 maxnum = number[j];
         }
         for(int i=;i<strlen(str4);i++)
         {
             if(str4[i]==' '||str4[i]<'A'||str4[i]>'Z')
                 continue;
             int j = (int)str4[i]-;
             number[j]++;
             if(number[j]>maxnum)
                 maxnum = number[j];
         }
         int temp = maxnum,flag=;
         for(int j = ;j<temp;j++)
         {
             flag=;
             for(int m=;m<;m++)
                 if(number[m]==maxnum)
                 {
                     flag = m;
                 }
             for(int k =;k<;k++)
             {

                 if(number[k]!=&&number[k]==maxnum)
                 {
                     if(flag==k)
                     {
                         printf("*");
                         number[k]--;
                         break;
                     }
                     else printf("* ");
                     number[k]--;
                 }
                 else
                 {
                     cout<<"  ";
                 }
             }
             printf("\n");
             maxnum--;
         }
         char c='A';
         for(int i=;i<;i++)
             printf("%c ",c++);
         printf("%c\n",c);

     }
     return ;
 }

这题被搞的没心情了，很简单的一题，结果那个输出结果每一行最后一个星号后面不能有空格，弄的我wa半天，改写了各种代码，总是过不了，后来看了看了讨论区，有种想吐血的冲动。