把老师给的PPT，上传了。 是说数据结构。

运动会分数统计,我的课程设计,用c语言编写的,-Games Score statistics, my curriculum design, with c languages,

本系统采用Visual Foxprow 5.0编写,面向对象可视化编程,使系统的开发工作适应目前的流行趋势。设计时采用了常用的自顶向下的瀑布式结构化设计方法。各子系统具有独立的数据库结构，设计时力求简单易用，便于维护。各模块为平行关系，彼此间无直接的参数联系，也无库的交叉关联，从而保证各子系统可以单独运行。-the system using Visual Foxprow 5.0 preparation, visual, object-oriented programming, allowing the system to adapt to the current development trend in fashion. Used in the design of the popular top-down waterfall structure design method. The subsystem is independent of the database structure, design sought to be simple to use, easy to maintain. Each module for parallel relationship between the parameters are not directly linked, nor for the cross-linked, so that the subsystems can be run separately.

Oracle BerkeleyDB（Oracle内嵌数据库，没有提供Borland C++Builder编译版本），该源码把BerkeleyDB 4.5.20的Visual C++ 2005的代码移植到Borland C++Builder上编译，生成静态库，可以在Borland C++Builder中进行开发使用. 工程文件路径为： db-4.5.20uild_windowsLibdb45BCB.bpr 编译后生成静态库为： Libdb45BCB.lib-Oracle BerkeleyDB (Oracle embedded database failed to provide Borland C Builder version), The source put BerkeleyDB 4.5.20 2005 Visual C code transplant Bo Identical compiled C Builder, generate static libraries, in Borland C Builder for development use. paper trails for the project : db- 4.5.20 build_windows Libdb45BCB.bpr compiler After generating static libraries : Libdb45BCB.lib

一个简单的网上书店系统，运行环境是ASP+ACCESS.具体功能为添加书籍，点击浏览，购买等等。-A simple online bookstore system, runtime environment is ASP+ ACCESS. Add specific functionality for the books, click on browse, purchase and so on.

数据结构二叉树的源码-binary tree data structure FOSS

考勤管理系统源码-Attendance Management System FOSS

矩阵求逆的c++程序,用来算大规模带分数形式的逆矩阵的,文件输入-matrix inversion c procedures for the large-scale Daibanshu form of the inverse matrix, the file input

因为用mfc做了一个应用程序，需要在没有数据库的情况下，读取excel中的数据，需要注意的是要在文件名前面加上强制类型转换符L

描述 问题描述： 给定一个只包含数字[0..9]的字符串，求使用字符串中的某些字符，构建一个能够整除15的最大的整数。 注意，字符串中的每个字符只能使用一次。 编程任务： 求由给定字符串构建的能够整除15的最大整数。-Description of the problem description: Given a contain only numbers [0 .. 9] of the string, seeking to use some of the characters in the string, one can build the largest integer divisible by 15. Note that the string for each character can only be used once. Programming task: seeking from the given string that can build the largest integer divisible by 15.

1．定义串的顺序存储结构。 2．编写函数实现串的初始化、分配、取子串算法 3．编写函数据实现串的模式匹配-1. The definition of the order of string storage structure. 2. The initialization string write function implementation, distribution, taking sub-string algorithm 3. Write a function, according to string pattern matching to achieve