垂直柱状图

#include <bits/stdc++.h>
using namespace std;
int s[27];
int f(char a){
	if(a=='A')
		return 1;
	if(a=='B')
		return 2;
	if(a=='C')
		return 3;
	if(a=='D')
		return 4;
	if(a=='E')
		return 5;
	if(a=='F')
		return 6;
	if(a=='G')
		return 7;
	if(a=='H')
		return 8;
	if(a=='I')
		return 9;
	if(a=='J')
		return 10;
	if(a=='K')
		return 11;
	if(a=='L')
		return 12;
	if(a=='M')
		return 13;
	if(a=='N')
		return 14;
	if(a=='O')
		return 15;
	if(a=='P')
		return 16;
	if(a=='Q')
		return 17;
	if(a=='R')
		return 18;
	if(a=='S')
		return 19;
	if(a=='T')
		return 20;
	if(a=='U')
		return 21;
	if(a=='V')
		return 22;
	if(a=='W')
		return 23;
	if(a=='X')
		return 24;
	if(a=='Y')
		return 25;
	if(a=='Z')
		return 26;
}
int maxs;
int main(){
	
	char a[105];
	cin.getline(a,105);
	for(int i=0;i<strlen(a);i++)
		s[f(a[i])]++;
	char b[105];
	cin.getline(b,105);
	for(int i=0;i<strlen(b);i++)
		s[f(b[i])]++;
	char c[105];
	cin.getline(c,105);
	for(int i=0;i<strlen(c);i++)
		s[f(c[i])]++;
	char d[105];
	cin.getline(d,105);
	for(int i=0;i<strlen(d);i++)
		s[f(d[i])]++;
	for(int i=1;i<=26;i++)
		maxs=max(s[i],maxs);
	for(int i=maxs;i>=1;i--){
		for(int j=1;j<=26;j++){
			if(s[j]>=i)
				cout<<"*"<<" ";
			else
				cout<<" "<<" ";
		}
		cout<<endl;
	}
	cout<<"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";
}

本来想水题来着 被普及-的题弄傻了