brjtag v1.9o 源代码

Winamp样式的自动停靠对话框-Winamp-style automatic berth dialog

八皇后问题的求解 本程序是在java平台上开发完成 -8 Queen of the procedure is to solve the java platform developed

这是我在学习c++时,随意写的小程序,虽然简单,但是用到了类的各个方面,仅供参考-This is my learning c, wrote arbitrarily small procedures, although simple, but the type used in all aspects, for reference

Problem Set is the place where you can find large amount of problems from different programming contests. Online Judge System allows you to test your solution for every problem.-Problem Set is the place where you can find large amount of problems from different programming contests. Online Judge System allows you to test your solution for every problem.

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

Face Detection from OpenCV

将为给定在名为的文件中的数据执行非线性回归的 C 代码exp.zip 包含 61 x ；y 值的方程 y = a0 （1-exp(a1x)) x = 1。

八皇后问题，用Ｃ＋＋编程，在ＶＣ＋＋上运行正确，效率还不错-eight Queen"s problems, and use C++ programming in Visual C++ running on the right, also good efficiency

关于猎人过河问题 要解决这个问题就要使过河时载两个过河，返回时尽量只有一个回来。用一个字符串数组来存猎人，狼，羊，白菜；下标依次为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.

用vC++文字界面编写的较为简单的通讯录，实现存储，查找，删除等功能。-VC++ language interface with a relatively simple address book to prepare for storage, search, delete functions.