VC++图书管理系统完整版

VC++中使用的矩阵类模板，实现矩阵存储，转置等问题。-VC++ matrix class template used to achieve matrix storage, transpose and other issues.

这是作为一个系统，在商店中使用的应用程序。它包括一个客户数据库，即它可以保存数据库 f 客户提供的几个细节。它也有一个产品数据库应用程序即可以持有这家商店出售的产品的列表。最后，它也有一个订单数据库从哪里可以检索以前订单的详细信息。此外包括从哪里可以做订单库存数据库。

实现运动对象探测，效果很好的哦，大家有什么意见可以跟我联系！-moving object detection achieve good results, um, what kind of advice you can contact me!

自作记事本，-for notebook, s

BP算法拟合f(x1,x2)=sin((x1)/x1)*sin((x2)/x2)*函数,样本数为21*21对-BP fitting algorithm f (x1, x2) = sin ((x)/x)* sin ((x2)/x2)* function, sample size of 21* 21 pairs

实现了C++的分数类，实现的分数与整数，分数与int,整数与int的混合操作，用多态和虚函数来实现digit_number()-Realize the C++ The Score category, the scores and realize integer, scores and int, and int mixed integer operations, using virtual functions and polymorphism to achieve digit_number ()

在vc++平台下，用分支限界法和回溯法实现的旅行售货员问题。经本人测试运行无误，包括运行文档。-In vc++ Platform, using branch and bound and backtracking realize the travel salesman problem. After I run the correct tests, including the operation of the document.

关于猎人过河问题 要解决这个问题就要使过河时载两个过河，返回时尽量只有一个回来。用一个字符串数组来存猎人，狼，羊，白菜；下标依次为0，1，2，3；但他们都有河这边和那边两种状态；为方便则定义一个结构，只含一个int型变量n；当在河这边时n设为0；在河那边时n设为1。由于每次过河与返回都要考虑狼能否吃羊或羊能否吃白菜；则需要一个函数来判断每次选择是否满足条件。-Hunters across the river on the issues to resolve this issue so we should cross the river when the two set out across the river to return to when there is only one back as far as possible. Using a string array to keep hunters, the wolf, sheep, and cabbage subscript followed by 0,1,2,3 but they have a river here and there two states To facilitate the definition of a structure containing only an int variable n When in the river here when n is set to 0 in the river when n is set to one side. Due to cross the river and return each time to consider whether the wolf can eat the sheep吃羊or cabbage you need a function to determine each choose whether or not to meet the conditions.

很方便的以前写的一个关于扫雷的源代码，用的MFC编写的，大家都要看看，有需要的可以下载下，试着玩一玩，其实也挺有意思的。。

一个学生成绩管理的系统，很经典，适合初学者-grade management system,sutra,used to beginner