Introduction - If you have any usage issues, please Google them yourself
Curriculum design:
1. Obtained in an n × n chessboard, the place to catch each other should not n个chess "Queen" of all the layout.
2. The design of a use of Huffman coding and decoding algorithms systems, and deal with duplicate to show the following items until the exit date selection.
The basic requirements 【】
1) will be the right value data stored in data files (file named data.txt, located in the implementation of procedures in the current directory)
2), respectively, dynamic and static storage structure
3) Initialization: keyboard input character set size of n, n and n characters of the right value, set up Huffman tree
4) Coding: Using the built Huffman tree generated Huffman coding
5) output coding
6) The character set and the frequency of the following table:
Space characters A B C D E F G H I J K L M
Frequency of 186 64 13 22 32 103 21 15 47 57 1 5 32 20
Character N O P Q R S T U V W X Y Z
Frequency 57 63 15 1 48 51 80 23 8 18 1 16 1