acm HDOJ 1051WoodenSticks
Description:
There is a pile of n wooden sticks. The length and weight of each stick are known in advance. The sticks are to be processed by a woodworking machine in one by one fashion. It needs some time, called setup time, for the machine to prepare processing a stick. The setup times are associated with cleaning operations and changing tools and shapes in the machine. The setup times of the woodworking machine are given as follows:
(a) The setup time for the first wooden stick is 1 minute.
(b) Right after processing a stick of length l and weight w , the machine will need no setup time for a stick of length l and weight w if l<=l and w<=w . Otherwise, it will need 1 minute for setup.
The Game:
Make the snake grow longer by directing it to the food.
Extra bonus points are given from hearts, eat them as fast as possible as amount of bonus points decreases with time.
Higher level gives more points for the food but will also make it tougher to steer a long snake as speed increaces.
Five different mazes as well as play w/o maze are possible.
auxilary files for the Crypt Breakers Workbench (cbw). CBW is
a multi-window integrated workbench of tools that help a cryptanalist
read files encrypted with the BSD4.2 crypt command. Anyone
may copy, modify, use, or redistribute this system. It was
originally written by Robert W. Baldwin at MIT
實現最優二叉樹的構造；在此基礎上完成哈夫曼編碼器與譯碼器。 假設報文中只會出現如下表所示的字符：
字符 A B C D E F G H I J K L M N
頻度 186 64 13 22 32 103 21 15 47 57 1 5 32 20 57
字符 O P Q R S T U V W X Y Z ， ．
頻度 63 15 1 48 51 80 23 8 18 1 16 1 6 2
要求完成的系統應具備如下的功能：
1．初始化。從終端（文件）讀入字符集的數據信息，。建立哈夫曼樹。
2．編碼：利用已建好的哈夫曼樹對明文文件進行編碼，并存入目標文件（哈夫曼碼文件）。
3．譯碼：利用已建好的哈夫曼樹對目標文件（哈夫曼碼文件）進行編碼，并存入指定的明文文件。
4．輸出哈夫曼編碼文件：輸出每一個字符的哈夫曼編碼。
K9F1208U0M 的ALE、CLE分別由DSP 的A1 和A0 控制。DSP的低8位數據線直接與閃存的I/O0-I/O7 相連，實現命令、地址和數據的傳輸； DSP的通用I/O口IOA2 接R/B，監測存儲器的工作狀態，當R/ B 處于低電平時,表示有編程、擦除或隨機讀操作正在進行；操作完成后, R/ B 會自動返回高電平。DSP的W E 、R D 分別接FLASH的W E 、R E ， 控制讀、寫操作。CS2接閃存的片選線CE。
