Description: Huffman tree ah. Input Description: multiple sets of data, the first act integer m, which means that there are several sets of data, each line of input data into two the value of n first act, the second act n integers, representing the character frequency of occurrence. Output Description: For each data output an integer that represents the Huffman tree structure with the right path length (integer output after newline).
To Search:
File list (Check if you may need any files):
huff fuckfuckfuck.c
Download