ASCII码的回数，我们可以读到。

这是一个把汉字或其他文字转换成unicode码表示的字节数组的程序-This is a letter to Chinese characters or other unicode code into the byte array that the procedure

光软件站- - - 文件编程-源程序代码下载(2)c语言窗口界面320x200x256VGA模式下的字体.zip-Light software stations--- file programming- source code download (2) c language interface window mode Dx200x256VGA fonts. Zip

自己做的关于Modbus RTU通信的16位CRC校验码生成的示例，希望对各位有所帮助-Own on the Modbus RTU communication 16 CRC checksum generated code example, you want to be helpful

一个将MP3文件转换为WAV文件的源程序，需要mp3play.ocx-An MP3 file will be converted to WAV files source, the need mp3play.ocx

0-l背包问题是子集选取问题。一般情况下，0-1背包问题是NP难题。0-1背包 问题的解空间可用子集树表示。解0-1背包问题的回溯法与装载问题的回溯法十分类 似。在搜索解空间树时，只要其左儿子结点是一个可行结点，搜索就进入其左子树。当 右子树有可能包含最优解时才进入右子树搜索。否则将右子树剪去。设r是当前剩余 物品价值总和；cp是当前价值；bestp是当前最优价值。当cp+r≤bestp时，可剪去右 子树。计算右子树中解的上界的更好方法是将剩余物品依其单位重量价值排序，然后 依次装入物品，直至装不下时，再装入该物品的一部分而装满背包。由此得到的价值是 右子树中解的上界。-0-l knapsack problem is selected subset of the problem. Under normal circumstances, 0-1 knapsack problem is NP-hard. 0-1 knapsack problem the solution space available subset of the tree said. Xie 0-1 knapsack problem with the law retroactively loading the retroactive law very similar. The search solution space trees, as long as their son left node is a viable nodes, the search entered its left subtree. When the right subtree is the optimal solution may contain only son into the right tree search. It will cut right subtrees. Suppose that r is the total value of the remaining items; Cp is the current value; Bestp is currently the best value. When cp r bestp, they can cut right subtrees. Calculation right

介绍了Windows CE下对注册表操作的API函数的使用-introduced the Windows CE operating under the registry of the use of API function

This document explains how to web develop in SAP.

一本C++的进阶教程，看了以后对编程有很大帮助。（中文版）-1 C++ The Advanced Course, looking after the programming has great help to me. (Chinese Version)

ThinkingC++中文版，适合初级c++学习者阅读 03部分-ThinkingC++ Chinese version, suitable for primary c++ Learners read the 03 part

Free VoIP Softphone for Windows Mobile