包括窗体与界面、控件、系统、文件、图形图像、多媒体、数据库 、网络、动态链接库等...

数据结构中关于树、栈、队列等数据结构的一些算法的C语言实现，给需要的人-Data structure on the tree, stack, queue data structure, such as some of the C language algorithm realize, to those who need

这个源代码是在线购物车。他们只有一个用户可以选择产品并提交未经注册的信息。

数据结构基本算法实现 用C++实现理发馆防真功能-basic data structure algorithm in C-achieving barber"s shop really function

这里有一些数据结构中的通用算法，拿出来和大家共享了◎-Here are some of the generic data structure algorithms, up to and everyone shared ◎

图书管理程序,b-tree,c++语言完成。程序非常的棒-library management procedures, b-tree, c complete language. Procedures for the wand! !

学生初学，c实现约瑟夫环(圆桌问题)，算法应该不是很高效，望各位高人看了改进改进！-beginner students, c achieve Joseph Central (round table), the algorithm should not be very efficient, a person looking to improve reading improvement!

计算机数据库方面的有关内容,对需要毕业设计的外文翻译的同学有用-Computer database of the contents of the graduation project required the translation of foreign language students useful

好用的仓库管理系统-user-friendly Warehouse Management System

约瑟夫问题有原始的约瑟夫和发展了的约瑟夫两种。 原始的约瑟夫的描述： 古代某法官要判决N个犯人的死刑，他有一条荒唐的法律，将犯人站成一个圆圈，从第S个人开始数起，每数到第D个犯人，就拉出来处决，然后再数D个，数到的人再处决―――直到剩下的最后一个可赦免。 发展的约瑟夫的描述： 古代某法官要判决N个犯人的死刑，但这N个人每人持有一个密码，他有一条荒唐的法律，将犯人站成一个圆圈，法官先给出一个密码M，从第S个人开始数起，每数到第M个犯人，就拉出来处决，再根据这个人所持有的密码F，然后再数F个，数到的人再处决，以此类推―――直到剩下的最后一个可赦免。-Joseph problems have original development of the Joseph and Joseph two. The original Joseph Description : Ancient a judge to sentence N inmates of the death penalty, he is a ridiculous law, prisoners station into a circle, from S began a few individuals, every few months to D prisoners, pull out executions, then D, the number of people to be re-executed--- until the last one left to be pardoned. The development of the Joseph Description : Ancient a judge to sentence N inmates of the death penalty, but each individual N holders a password, he is a ridiculous law, prisoners station into a circle, the judges first gave a password M, S individuals from the beginning of several, each of the first few inmates M , pull hi

VC读写excel