POJ 2136 解题报告

来源：互联网发布：java课程设计管理系统编辑：程序博客网时间：2024/05/11 15:05

简单题。

thestoryofsnow2136Accepted132K0MSC++1137B

/* ID: thestor1 LANG: C++ TASK: poj2136 */#include <iostream>#include <fstream>#include <cmath>#include <cstdio>#include <cstring>#include <limits>#include <string>#include <vector>#include <list>#include <set>#include <map>#include <queue>#include <stack>#include <algorithm>#include <cassert>using namespace std;inline bool isUpperCase(char ch){return 'A' <= ch && ch <= 'Z';}int main(){int cnt[26] = {0};char line[74];for (int l = 0; l < 4; ++l){fgets(line, 74, stdin);for (int i = 0; line[i] != '\0'; ++i){if (isUpperCase(line[i])){cnt[line[i] - 'A']++;}}}int maxh = *max_element(cnt, cnt + 26);for (int h = maxh; h >= 1; --h){for (int i = 0; i < 26; ++i){if (cnt[i] >= h){printf("*");}else{printf(" ");}if (i != 25){printf(" ");}else{printf("\n");}}}for (int i = 0; i < 26; ++i){printf("%c", 'A' + i);if (i != 25){printf(" ");}else{printf("\n");}}return 0;  }

0 0