一个相当好的树状目录程序，实用于动态网站数据库，可以动态显示产品目录结构...

绿色征途2 本帖最后由 quyan123456789 于 2013-8-28 16:59 编辑 $ Z: [. G6 {& h6 u  M) M1 e* B 帖子发了将近有1年时间了，现在成了置顶帖很高兴

彩电故障信息共享系统 本程序使用Visual C++６.0编程制作信息共享系统,实现信息管理共享的自动化。由此实现了信息的增加、删除、修改、查看等功能，并且进而实现信息的安全管理，使信息的管理更加人性化，规范化。从而提高故障排除效率，提高信息利用率，有助于进一步提高了生产效率。-TV fault information sharing system of the present procedures using Visual C 6.0 programming produced information sharing system, Sharing information management automation. This realization of the information to add, delete, modify, check, and other functions, and thereby achieve information security management, information management more humane and standardized. Improve troubleshooting efficiency, improve utilization of information and help further enhance the efficiency of production.

一辆汽车加满油后可行驶n公里。旅途中有若干个加油站。设计一个有效算法，指出应在哪些加油站停靠加油，使沿途加油次数最少。对于给定的n和k个加油站位置，编程计算最少加油次数。并证明算法能产生一个最优解-Fill up the car after driving an n km. There are a number of gas stations journey. Design an efficient algorithm that at which stations should stop to refuel along the way so that the least number of refueling. For a given n and k-station location, the calculation program for at least the number of refueling. And to prove that the algorithm can produce an optimal solution

程序读取所有；

PostgreSQL7.4.6 for Linux

vfp的界面，系统登陆时的表单。（压缩文件）-Probe interface, the system of landing form. (Compressed files)

基于十进制的四叉树的空间数据结构编码。 利用行数和列数求莫顿码 利用莫顿码求行数和列数-Decimal-based quadtree spatial data structure coding. To use the number of rows and columns seeking Morton Morton yards yards seeking to use the number of rows and columns

这是计算机专业硕士生课程《算法设计与实现》中讲到的模式匹配算法的实现，并且将该算法与KMP算法进行了比较。-It was the professional degree programs, "Algorithm Design and Implementation" referred to the pattern matching algorithm implementation, and algorithm and KMP algorithm are compared.

中缀表达式转换为后缀表达式并求值 使用switch语句-Infix expression into a suffix for the value of expression and the use of switch statement

倒置一个单链表，链表是带有头结点的单链表，通过不断在表头插入结点，使链表有序-Inversion of a single linked list, linked list is the first node with a single list, through constant head inserted in the table node, so that an orderly list