Inverse Huffman --- Introduction ---

Inverse Huffman is an exercise over the optimal encoding of a system of information, by a code of variable lengths. But the style of the exercise is in the inverse direction: the server gives you a code, and asks you to find a distribution of probabilities such that the given code is optimal.
Choose the parameters of the exercise
  • (between 3 and 52),
  • (between 2 and 16).
The most recent version

ÓÉÓÚ WIMS ²»ÄÜʶ±ðÄúµÄä¯ÀÀÆ÷, ±¾Ò³²»ÄÜÕý³£ÏÔʾ.
ΪÁ˽øÈë WIMS ·þÎñÆ÷, ÄúµÄä¯ÀÀÆ÷±ØÐëÖ§³Ö forms. Ϊ²âÊÔÄúÕýÔÚʹÓõÄä¯ÀÀÆ÷, ÇëÔڴ˼üÈë wims: ÔÙ°´»Ø³µ.

Çë×¢Òâ: WIMS µÄÍøÒ³Êǽ»»¥Ê½µÄ: ËüÃDz»ÊÇͨ³£µÄ HTML Îļþ. Ö»ÄÜÔÚÏß½»»¥µØ ʹÓÃ. ÄúÓÃ×Ô¶¯»¯³ÌÐòÊÕ¼¯µÄÍøÒ³ÊÇÎÞÓõÄ.