(Classic map) A-hardwood species (7.1.1) (an experimental example of programming using the sorting function inherent in STL)

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 2x4 s and 2x6 s, with some limited decorative applications.

Using satellite imaging technology, the Department of Natural Resources has compiled an inventory of every tree standing on a particle 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

 

 

In map, Map <Int, String> personnel; the int in is an index item, which is equivalent to the subscript in the array and used as a search mark.

When a new string is input, if it is an existing string, the original space is used instead of opening up new space, however, if not, an index is opened to the space of the current input string.

It can be verified by the size function in map (refer to the URL)

Other map functions (website)

 

In addition, whether the index can be performed through character arrays during definition remains to be verified !!!

 

# Include <iostream>
# Include <cstdio>
# Include <string>
# Include <cstring>
# Include <map>

Using namespace STD;

Typedef Map <string, int> record;
Record h;
String S;
Int N;
Int main ()
{
N = 0;
While (Getline (CIN, S) //// the result is output only after the end of the file by default.
{
N ++;
H [s] ++; // Add 1 to the current int data
}
Record: iterator it; // defines the map (container) pointer
For (IT = H. Begin (); it! = H. end (); It ++) //////////////// // output all values from start to end. note h. begin () is the first, but h. end () is not the last one, but has no value in it.
{
String name = it-> first; // The first variable is a string.

Int K = it-> second; /// // output the corresponding data

Printf ("% S %. 4lf \ n ", name. c_str (), double (k) * 100/double (n); // name here. c_str () is a conversion function, because printf cannot output a string (string) it must be converted to a char group type of /////// awaiting verification !!!!!!!!!!!!!!!!!!

}
Return 0;
}