文本格式的bit流转化为binary格式的字节流

原来的库（MFCXLib）已经更名为CJ60Lib，这是为了与那些使用旧库的程序区别开来。本库与旧的库具有同样的功能，但是，针对Visual C++ 6.0作了几个扩展-The original library(MFCXLib) s name has been changed to CJ60Lib, which can distinguish the programs using old library. The library has the same functions as the old one. But some extention has been added aimed at Visual C++6.0.

利用c语言编写程序，由键盘输入多边形的边数，求其内角和。-Programming using c language, keyboard input from a number of polygon edges, and the angles and.

这是一个关于汉诺塔的书机-HANOR on the book-

[C/C++]哈夫曼编码及译码 构造赫夫曼树 HT , 并求出 n 个字符的赫夫曼编码 HC //将结果存入 hufTree.txt-[C/C] Huffman coding and decoding structure HT Huffman tree, and obtained n characters of Huffman coding HC// results deposited hufTree.txt

改程序简单的应用了C++中的各种标准模板容器！对于初学C++标准模板库的同学是一个和好的全集教程，代码简单，易于分析研究！

改进的黑白棋程序,不仅实现了黑白棋基本的游戏功能和规则,还在网络对战上做了开发.开发环境JAVA-improved procedures, reversi not realize the basic functions of the game and rules, but also the stages of development done. Java Development Environment

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

步进立方体算法（marchingcubes)是三维标量场可视化，体数据可视化，三元隐函数可视化图形化的经典算法，源码包含visual studio 完整项目文件，是C++,OpenGL代码。

各种时间间隔方式测试比较-various time intervals comparison testing

flex鱼眼特效类，可以为RIA应用增加亮点-flex-type fish-eye effects, you can increase the bright spot for RIA applications