Description: The length of the description of the problem is known to enter a positive integer, a positive integer with a separate spacebar create a Huffman tree, digital input leaf node, find tree Huffman tree with the right path . Input form] First enter the number of positive integers, then the next for the next positive integer, is the integer number of not more than 10 [output in the form] output corresponding weights sample input] 545,678 【sample output】 69.
To Search:
File list (Check if you may need any files):
0303
....\0303.c
....\0303.dsp
....\0303.dsw
....\0303.ncb
....\0303.opt
....\0303.plg
....\Debug
....\.....\0303.exe
....\.....\0303.ilk
....\.....\0303.obj
....\.....\0303.pch
....\.....\0303.pdb
....\.....\vc60.idb
....\.....\vc60.pdb