1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62
| #include <bits/stdc++.h> using namespace std; typedef long long ll; typedef unsigned long long ull; const int maxn = 1e5 + 5;
#define rep(i, a, n) for (int i = a; i < n; ++i) #define per(i, a, n) for (int i = n - 1; i >= a; --i) #define fi first #define se second #define pb push_back #define np next_permutation #define mp make_pair #define endl '\n' int a[maxn]; string s; int mmax; int main() { ios::sync_with_stdio(false); mmax = -1; rep(i, 0, 4) { getline(cin, s); rep(i, 0, s.length()) { if (s[i] >= 'A' && s[i] <= 'Z') { a[s[i] - 'A']++; if (a[s[i] - 'A'] > mmax) mmax = a[s[i] - 'A']; } } } per(i, 1, mmax + 1) { int target = 25; per(j, 0, 26) { if (a[j] >= i) { target = j; break; } } if (a[0] >= i) cout << "*"; else cout << " "; rep(j, 1, target + 1) { if (a[j] >= i) cout << " *"; else cout << " "; } cout << endl; } cout << 'A'; rep(i, 1, 26) cout << " " << char('A' + i); cout << endl; cin >> mmax; }
|