[Problem Description] known input string of positive integers, positive integers separated by a space key, create a Huffman tree to enter the number of leaf nodes, find the right tree Huffman tree with path length . [Form] enter the number of first enter a positive integer, then the next for the next positive integer, the number of positive integers up to 10 outputs in the form [] output corresponding weight

1\4-1.c
.\4-1.dsp
.\4-1.dsw
.\4-1.ncb
.\4-1.opt
.\4-1.plg
.\Debug\4-1.exe
.\.....\4-1.ilk
.\.....\4-1.obj
.\.....\4-1.pch
.\.....\4-1.pdb
.\.....\try.pch
.\.....\vc60.idb
.\.....\vc60.pdb
.\try.c
.\try.dsp
.\try.dsw
.\try.ncb
.\try.opt
.\try.plg
.\Debug
1

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．