用循环链表实现约瑟夫问题

c++写的一个关于数据结构的苹果纠纷的数学问题,相信会给喜欢数据结构的朋友们带来帮助!-c write a data structure on the Apple disputes the mathematical problem, I believe, would like the data structure to help bring friends!

这是用链表实现的栈数据结构。链表数据结构的最大优点是不受元素个数的限制，除非内存耗尽。-This is the stack implementation with linked list data structure. List data structure is not subject to the greatest advantage of the restricted number of elements, unless the memory run out.

利用简单优先法输出逆波兰式 将中缀式转化成逆波兰式-priority method using simple inverse Polish exports of Chinese-grade into reverse Polish

MySql中文帮助文档。学习MySql数据库-MySql Chinese help documentation. Learning MySql database

这是LabwindowsCVI得数据库开发支持包，安装后可获得相关数据库驱动、数据库开发工具的.DLL和.fp-LabwindowsCVI,SQL TOOLKits

VC操作MYSQL的一些例子-VC operation MYSQL some examples

这是一个分治解决的零件切割问题:给定一块宽度为W的矩形板，矩形板的高度不受限制。现需要从板上分别切割出n个高度为hi，宽度为wi的矩形零件。切割的规则是零件的高度方向与矩形板的高度方向保持一致。问如何切割使得所使用的矩形板的高度h最小？加上一个小界面-This is a solution to the partition cutting parts : a given width of the rectangular plate W, the height of rectangular plate unrestricted. Board is required from the respective cut out n height of the hi, wi width of the rectangular parts. Cutting parts to the rules of the height of the rectangular plate with a high degree of consistent direction. Asked how cutting makes use of the rectangular plate height h minimum? A small interface

用PB设计的前台界面-with the prospects PB interface design

ORACLE 数据备份,实现oracel数据库的正提，表，记录的分别备份,功能强大，操作方便，可以放心使用，

数据库Blob读写-database Blob literacy