搜索资源列表
TestProblemsforUnconstrainedOptimization
- it contains many classic Test Problems for Unconstrained Optimization such as camel6,treccani,goldstein,branin, shubert1,Ackley,dejong,dejong1,dejong2, dpower,rastrigin,Griewangk,Schwefel, rosenbrock2 and step. the package have the contour an
fenzhifa
- 棋盘覆盖问题，是用分治法实现的。基本上全是数字实现的。虽然简单，但是这是为了说明一个算法的设计问题-Board cover problem is the use of sub-rule method to achieve. Basically, all the figures attainable. Although simple, but this is to illustrate the design of an algorithm
magicnum
- 魔方陣運算，輸入1~19的奇數產生1~N*N的數字，執行出來顯示斜、橫、列合相等-Magic square operator, enter 1 to 19 have the odd 1 ~ N* N of the figures shows that the implementation by the oblique and horizontal, are shown together equal
fig_mpi
- Is the figure on the plane, presented in the form of plural-va points (xi, yi) There are changes that need to perform (turning, moving, scaling) Leave the system, which has undertaken the conversion figures, but every single child process may t
dutu
- 读写两幅图并计算前后两幅图中的标记点间的距离-Read and write two images and calculate the two figures before and after the distance between markers
java
- //需求分析：写一个成绩管理系统。其中的一个功能是实现成绩录入。要求能根据课程名称在系统里找到学生和课程信息；在结果区域中添加成绩。 //规则：要求对输入成绩的操作要有有效性检验。成绩只接受大于0且小于100的数字；同一记录不能反复提交；当点击“提交”，告知用户操作是否成功，并给出相应信息；课程名下拉列表中的课程列表根据数据库中的课程表，自动生成。-//Demand analysis: write a performance management system. One of thes
guess
- 猜數字 cout< "猜數字\n"<<"規則:1.輸入0~9的正整數\n"<<" 2.數字不能正整數\n" <<" 3.輸入四個數字(不能重複)\n" <<" 4.A=位子且數字對\n"<<" 5.B=數字對但位子不對\n"<<"PS.輸入:0 0 0 0換題\n"<<" 輸入:3 1 6 6離開猜數字\n" <<" 輸入9 9 5 8求救\n"<<" 每個數字請用空格分