资源列表
魔方阵的问题求解
- #include"stdio.h" #include"stdlib.h" int main() { int i ,j,a[100][100],n,k,flag=1; while(scanf("%d",&n)!=EOF&&(n%2!=0)) { for(i=0;i<n;i++) for(j=0;j<n;j++) a[i][j]=0; j=n/2; a[0][j]=1; i=0
DP问题
- 动态规划解决乘号插入问题
max262
- max262驱动程序，已经通过检验，可改变输入参数，来设置带通、低通、高通模式。-max262 driver has passed the examination
WG-ABA
- 介绍了在数据库中，如果实现ABA与WG卡号的转换，方便一卡通各系统之间资料的同步-Introduced in the database, if the realization of ABA and WG conversion number for each card data synchronization between the systems
waterflowernumber
- 打印出所有的“水仙花数”，所谓“水仙花数”是指一个三位数，其各位数字立方和等于该数 本身。-Print out all of the " Narcissus few" , the so-called " Narcissus number" refers to a three-digit, the number of its Members and equal to the number of cubic itself.
juwe
- 查找一个数字,判断是否存在,如果不存在返回零.-To find a number to determine whether there is, if there is no return to zero.
1
- 近邻算法 部分代码的实现 平均值为1339.230662 可以自行调整-jinlinsuanfa
Jacobi
- 普通解矩阵时，在计算量想当大时候，会出现病态矩阵，这个程序采用迭代方法计算。-it s a way to calculate the matrix.everyone can have a try .solving the matrix is a problem ,this maybe can help you~
ODBCDemo
- 如何通过ODBC数据源来连接数据库，并进行各种操作-How to ODBC data source to connect to the database and carry out various operations
kingdee-old-bill
- 为kindee中的bos开发老工业单据，提供有效的注册方法。从而实现老单的开发-Development in the bos for the kindee old industrial documents, provide an effective method of registration. In order to achieve the development of the old one
minpso
- 无约束条件的粒子群优化算法代码，简单实用！-No constraints PSO algorithm code, simple and practical!
3
- 设集合S由若干单词（英文）组成，给定字符串K，在S中查找与K最佳匹配的结果。最佳匹配的结果定义为：与K有最长共同前缀的字符串。 例：S={abc, bdef, zhen, zhao, abdd}，K1=zhao，K2=abdf，K3=cheng，则与K1最匹配的结果是zhao，与K2最匹配的结果是abdd，与K3最匹配的结果是ε（空串）。 -Set the set S consists of several words (in English), with the given strin