poj Hardwood Species

Hardwood Species

Time Limit : 20000/10000ms (Java/Other)   Memory Limit : 131072/65536K (Java/Other)

Total Submission(s) : 2   Accepted Submission(s) : 1

Problem Description

Hardwoods are the botanical group of trees that have broad leaves, produce a fruit or nut, and generally go dormant in the winter.
America's temperate climates produce forests with hundreds of hardwood species -- trees that share certain biological characteristics. Although oak, maple and cherry all are types of hardwood trees, for example, they are different species. Together, all the hardwood species represent 40 percent of the trees in the United States.

On the other hand, softwoods, or conifers, from the Latin word meaning "cone-bearing," have needles. Widely available US softwoods include cedar, fir, hemlock, pine, redwood, spruce and cypress. In a home, the softwoods are used primarily as structural lumber such as 2x4s and 2x6s, with some limited decorative applications.

Using satellite imaging technology, the Department of Natural Resources has compiled an inventory of every tree standing on a particular day. You are to compute the total fraction of the tree population represented by each species.

 

 

Input

Input to your program consists of a list of the species of every tree observed by the satellite; one tree per line. No species name exceeds 30 characters. There are no more than 10,000 species and no more than 1,000,000 trees.

 

 

Output

Print the name of each species represented in the population, in alphabetical order, followed by the percentage of the population it represents, to 4 decimal places.

 

 

Sample Input

Red AlderAshAspenBasswoodAshBeechYellow BirchAshCherryCottonwoodAshCypressRed ElmGumHackberryWhite OakHickoryPecanHard MapleWhite OakSoft MapleRed OakRed OakWhite OakPoplanSassafrasSycamoreBlack WalnutWillow

 

 

Sample Output

Ash 13.7931Aspen 3.4483Basswood 3.4483Beech 3.4483Black Walnut 3.4483Cherry 3.4483Cottonwood 3.4483Cypress 3.4483Gum 3.4483Hackberry 3.4483Hard Maple 3.4483Hickory 3.4483Pecan 3.4483Poplan 3.4483Red Alder 3.4483Red Elm 3.4483Red Oak 6.8966Sassafras 3.4483Soft Maple 3.4483Sycamore 3.4483White Oak 10.3448Willow 3.4483Yellow Birch 3.4483

 

 

import java.text.DecimalFormat;import java.util.Collections;import java.util.HashMap;import java.util.LinkedList;import java.util.List;import java.util.Map;import java.util.Scanner;import java.util.Set;import java.util.Map.Entry;/** * 这道题如果用字典树有点麻烦，用map或者set比较简单 * @author wangfengyang */public class HduTest4 {public static void main(String[] args) {Scanner sc = new Scanner(System.in);String str = "";int n = 0;//一共输入了多少行Map<String, Integer> map = new HashMap<String, Integer>();while(sc.hasNextLine()) {str = sc.nextLine();n ++;int count = 1;if(map.containsKey(str)) {count += map.get(str);map.remove(str);}map.put(str, count);}List<Node> list = handleMap(map);showResult(n, list);}/* * 将Map中的元素构造成Node格式，插入到List中，并将List按照key进行排序 */private static List<Node> handleMap(Map<String, Integer> map) {Set<Entry<String, Integer>> set = map.entrySet();List<Node> list = new LinkedList<Node>();for(Entry<String, Integer> entry : set) {list.add(new HduTest4().new Node(entry.getKey(), entry.getValue()));}Collections.sort(list);return list;}private static void showResult(int n, List<Node> list) {for(Node node : list) {DecimalFormat format1 = new DecimalFormat("0.0000");//输出的时候按照printf会RE(错误)System.out.println(node.key + " " + format1.format((node.value+0.0)/n*100));//System.out.printf(node.key + " %.4f\n", (node.value+0.0)/n*100);}}class Node implements Comparable<Node>{public Node(String key, Integer value) {this.key = key;this.value = value;}String key;Integer value;@Overridepublic int compareTo(Node node) {return this.key.compareTo(node.key);}}}