sew_nointmr_peer

自己帮家里人写的一个废品收购管理数据库系统，数据库用的access，界面用的VC-To help people write their own home to buy a waste management database system, the database used access, interface with the VC

该项目是利用SQL开发。它是专为存储是从所谓的zoneict..It网站发送具有相互关联的另一个50表中的数据。所以，如果你想知道如何使用SQL将HEP那么创建表试下。祝好运

此类可以生成和检查短哈希值。

此代码为折半查找算法，适用于有序表，欢迎各位下载(This code is the binary search algorithm for ordered lists )

根据数据结构教材，利用循环队列，非常不错-based data structure materials, the use of recycling cohort, very good

多种排序方法的c实现和查找。入门看看还可以-various methods of sorting and searching c achieve. Portal can also see

算法设计中的经典问题，符号三角形，n皇后，圆排列-algorithm design of the classic, triangular symbols, n empress, with a round

付款引擎是对作为服务器端的工作非常有用，如果你不是详见推数据到客户端，因为它的非常庞大的查询语法或庞大的数据，一旦时间需要显示在报表或网格中的应用。每次启动，它总是检查空闲使用计时器。它的使用 delphi 与 MySQL 的后端。

说明：  今天，小 G 已了解到修理厂共有 m 种不同的修理原料，对于第 i 种原料，可以对任意一个石桥的美化度增加 di，当然这也需要花费 hi 的费用。由于发货场的修理原料有限，对于任意一种修理原料，只有一件，也就是说小 G 只能选择购买和不购买，对于第 i 种修理材料能成功修理第 j 个石桥的条件是：当且仅当 hi ≥ pj，di ≥ vj。现在，已知这 n 个石桥修理的最小花费值，最小美化需求度，以及 m 种修理原料的费用，可对石桥增加的美化度值，请你帮助小 G 完成这个修理任务。(Today, Xiao G has learned that there are m different repair materials in the repair shop. For the first material, Di can be added to the beautification of any stone bridge. Of course, it also costs hi. Because of the limited repair materials in the delivery yard, there is only one repair material for any kind of repair material, that is to say, small G can only choose to buy or not to buy. For the first repair material, the condition for successful repair of the jth stone bridge is: if and only if hi is greater than pj, Di is greater than vj. Now, the minimum cost of repairing n stone bridges, the minimum demand for beautification, and the cost of m kinds of repairing materials are known, which can increase the beautification value of stone bridges. Please help Xiao G to complete this repairing task.)

C#编写的应用程序，在VS2005下开发，包括GDI+的相关基本操作以及SQL Server数据库的操作-C# Prepared applications, in VS2005 under development, including GDI+ Relevant basic operation and the operation of SQL Server database