POJ 2136

 1 #include <iostream>
 2 #include <string>
 3 #define MAXN 26
 4 using namespace std;
 5 
 6 int _m[MAXN];
 7 
 8 
 9 int main()
10 {
11     //freopen("acm.acm","r",stdin);
12     int max = -1;
13     string s;
14     int i;
15     int k;
16     memset(_m,0,sizeof(_m));
17     for(k = 0; k < 4; ++ k)
18     {
19         getline(cin,s);
20         for(i = 0; i < s.length(); ++ i)
21         {
22             if(s[i] >= ‘A‘ && s[i] <= ‘Z‘)
23             {
24                 ++ _m[ s[i] - ‘A‘ ];
25             }
26         }
27         
28     }
29     for(i = 0; i < MAXN; ++ i)
30     {
31         if(_m[i] > max)
32         {
33             max = _m[i];
34         }
35     }
36 //    cout<<max<<endl;
37     for(i = max; i >= 1; -- i)
38     {
39         for(k = 0; k < MAXN; ++ k)
40         {
41             if(_m[k] >= i)
42             {
43                 cout<<‘*‘;
44             }
45             else
46             {
47                 cout<<‘ ‘;
48             }
49             cout<<‘ ‘;
50         }
51         cout<<endl;
52     }
53     for(char j = ‘A‘; j <= ‘Z‘; ++ j)
54     {
55         cout<<j<<‘ ‘;
56     }
57     cout<<endl;
58 }