光学字符识别

将翻盖的位图恰好贴在鼠标点击的方砖上（不论鼠标点击在这个方砖中的什么位置），真正实现翻盖的效果。并且要求和WindowsXP的扫雷程序的雷区部分一模一样。-Flip bitmap will be posted on the mouse just click on the方砖(whether or not the mouse click in this position in方砖), the effect of real flip. WindowsXP and the requirements and procedures for the de-mining part of the same areas.

在一个Ｎ×Ｎ的国际象棋棋盘中摆Ｎ个皇后，使这Ｎ个皇后不能互相被对方吃掉。-Put on N queens in a N multiply N chessboard,preventing each queen to be knocked over

魔方的kociemba算法

　在一个类中，C++用三个关键词设置访问界限：public, private和protected。它们决定了跟在他们后面的标识符的被使用情况：public意味着其后的标识符可以被用户定义的其实例引用 而private则说明其后的标识符除了类的成员函数之外，用户定义的其实例不能引用 protected为类的继承提供了接口，同时保护其不被外界访问。-In a class, C++ using the three keywords set to visit boundaries: public, private and protected. They decided to follow behind in their use of the identifier: public means the following can be user-defined identifier of the examples cited and private identifier is illustrated in the following categories of members in addition to function, the user the definition of its instances can not be invoked protected to provide the type of interface inheritance, at the same time not to be outside the protection of their visit.

高精度计算，实现完全256位的精度4则运算-High-precision calculation, 256 fully realize the accuracy of four computing

用C/C++打印一个圆形，这是一道某公司的面试题目-With the C/C++ to print a circle, which is subject of an interview of a company

一个PHP编写的搜索程序,英文版的.一开始是用来给新手教学用的,非常实用!-a PHP prepared by the search procedures and English. A start was for the purpose of teaching newcomers, very practical!

这个小应用是ASCII码和UNICODE码之间的转换工具-this small application is ASCII and UNICODE between the code conversion tools

初始化声卡、TBNR引擎、用户界面等。 2、启动TBNR引擎。 3、显示用户界面。 4、用户可以点击“开始录音”，以启动声卡，开始录音。-initialization sound card TBNR engine, user interface, and so on. 2, TBNR start the engine. 3, showing the user interface. 4, users can click on the "start recording," to start the sound card and started recording.

哈夫曼编码(Huffman Coding)，又称霍夫曼编码，是一种编码方式，哈夫曼编码是可变字长编码(VLC)的一种。Huffman于1952年提出一种编码方法，该方法完全依据字符出现概率来构造异字头的平均长度最短的码字，有时称之为最佳编码，一般就叫做Huffman编码（有时也称为霍夫曼编码）。 赫夫曼编码的具体方法：先按出现的概率大小排队，把两个最小的概率相加，作为新的概率 和剩余的概率重新排队，再把最小的两个概率相加，再重新排队，直到最后变成1。每次相 加时都将“0”和“1”赋与相加的两个概率，读出时由该符号开始一直走到最后的“1”， 将路线上所遇到的“0”和“1”按最低位到最高位的顺序排好，就是该符号的赫夫曼编码。