代码搜索:全差分

找到约 10,000 项符合「全差分」的源代码

代码结果 10,000
www.eeworm.com/read/480097/1323045

txt 周恒-5分.txt

#include #include #include #include int tile; //L型骨牌编号 int **chessarr; void chessboard(int row0,int col0,int size,int sprow,int spcol) /
www.eeworm.com/read/480097/1323046

txt 王敏-6分.txt

#include void move(int n,char a,char b,ofstream& out1) { out1
www.eeworm.com/read/480097/1323048

txt 张福泉-6分.txt

#include void move(int number,char A1,char A2,ofstream& out)//定义圆盘移动函数 { out
www.eeworm.com/read/480097/1323049

txt 董凌-6分.txt

#include #include #include class board { private: int n; int m; int *x; int *bestx; int bestd; int *total;
www.eeworm.com/read/480097/1323050

txt 陈锋-6分.txt

/*本程序运行前提: 在源程序目录下存在input.txt文件,并且该文件已经按一定格式存储若干值*/ #include #include #include class board { private: int n,//电路板数 m,//连接块数
www.eeworm.com/read/480097/1323052

txt 孙锋-4.8分.txt

#include #include #include int n; int totalweight; int *data; int *bestx; void readData() { ifstream inStream; inStream.open("input.txt"); if(!inStream)
www.eeworm.com/read/480097/1323054

txt 郑凌-6分.txt

//圆排列的最小长度算法 040000003 郑凌 #include #include #include #include //==================随机数类=========================== const unsigned long maxshort=65
www.eeworm.com/read/480097/1323056

txt 林政-3.5分.txt

#include #include #include #include class circle { private: float min; //当前最优值 float *x; //当前圆排列圆心横坐标 float *r; //当前圆排列 int n;
www.eeworm.com/read/480097/1323057

txt 梁淘-3分.txt

#include #include #include class triangle { friend int compute(int);//私有变量初始化函数 private: void backtrack(int); int n, //第一行的符号个数 half, //n*(n+
www.eeworm.com/read/480097/1323060

txt 孙锋-6分.txt

//圆排列的随机化算法 #include #include #include #include //随机数类 const unsigned long maxshort=65536L; const unsigned long multiplier=1194211693L; const u