Capturing the Extra Mouse Button Events. This program will demonstrate how to...

huffman tree 问题描述：设一份电文中有不同出现频率的字符，为了提高电文的输入和翻译效率，必须有一套简短而又不会产生歧义的字符代码。试根据哈夫曼算法，对电文中的不同字符，构造出一棵哈夫曼树，对每个字符进行编码。-Huffman tree Problem description : Let a message different frequency of the characters, in order to enhance the input and message translation efficiency, we must have a brief but no ambiguity of the characters code. Examination under Huffman algorithm, the message of characters, construct a Huffman tree for each character coding.

本程序基于MFC界面开发，使用编程语言C++，编程工具室VS2008，通过按下按钮，可自动检测连接到电脑上的HID设备以及相关的HID设备的信息，该工程需要在工程属性中添加testUSB文件中的头文件，在link中增量链接使能需要改为NO

C语言函数手册.chm.rar-C language function manual. Chm.rar

webgui,嵌入HTML页面-webgui, embedded HTML page ...................

简单的聊天程序,同学孙浩写的,呵呵,我觉得不错的.-A simple chat program, students write SUN Hao, Oh, I feel good.

tclocklight-040702-2-zh-tw-tclocklight-040702-2-zh-tw

ZIP压缩源码，原来少了一些库的也找到，大家可以放心下载-ZIP compression source, less the original library also find, we can be assured that download

这是老外整理的一份API 材料相当不错欢迎各位传阅，共同做好WINDOWS编程-This is a foreigner collate materials API quite welcome you circulated a joint effort Windows Programming

LCS问题就是求两个字符串最长公共子串的问题。解法就是用一个矩阵来记录两个字符串中所有位置的两个字符之间的匹配情况，若是匹配则为1，否则为0。然后求出对角线最长的1序列，其对应的位置就是最长匹配子串的位置。 最长递增子序列LCS的实现C源码！-LCS problem for two strings is the longest common sub-string problem. Solution is to use a matrix to record the location of two strings of all the matches between the two characters in the situation, if the match is one, otherwise to 0. And one of the longest diagonal obtained sequence, the location of its corresponding sub-string match is the longest position. The longest increasing sub-sequence source C implementation of the LCS!

button按钮的小程序-button button for the small program