HDU 2708 模拟
来源:互联网 发布:手机程序编程语言 编辑:程序博客网 时间:2024/06/06 08:36
Vertical Histogram
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2770 Accepted Submission(s): 653
Problem 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 YOURHISTOGRAM 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
忘了初始化maxPE好多次。。。。一个ge数组统计一行多少个* 来控制格式
0 0
- HDU 2708 模拟
- HDU 2708 Vertical Histogram [模拟]
- 【几何模拟】hdu 3286
- hdu 1020 Encoding(模拟)
- hdu 1303 Doubles(模拟)
- hdu 4020 模拟
- HDU **** 暴力模拟
- HDU 4068 模拟
- HDU 4121 模拟
- 【模拟】HDU 4134
- HDU-1279 模拟
- HDU-1035 模拟
- HDU-1283 简单模拟
- HDU-1263 模拟
- hdu 4140 模拟
- hdu 1034 #模拟
- hdu 4194#模拟
- hdu 4350 Card 模拟
- 计算机网络之面试常考
- AngularJS的digest循环和$apply
- [leetcode] 10.Regular Expression Matching
- 文本、日期、数字的连接
- Java中有关Null的9件事
- HDU 2708 模拟
- Spring与Struts区别联系
- 树莓派软件更新
- Sqlite 数据库 解析以及恢复(一)
- git diff
- ios多线程(NSThread)(swift)
- 《JAVA网络编程》阅读笔记(四)
- TCP的三次握手和四次挥手
- 基于C#的百度图片批量下载工具