代码搜索：有限差分
找到约 10,000 项符合「有限差分」的源代码
代码结果 10,000
www.eeworm.com/read/28694/1005688
exe 文件合并折分器.exe
www.eeworm.com/read/38129/1108353
exe 分压电阻计算工具.exe
www.eeworm.com/read/480097/1323041
txt 马航飞-5分.txt
#include
#include
#include
#include
int q(int n,int m)
{
if((n
www.eeworm.com/read/480097/1323047
txt 孙祯圻-6分.txt
//学号：041321215
//姓名：孙祯圻
//专业：软件工程
//题目：hanoi塔问题
#include
#include
#include
#include
//定义第一根柱子A为1，目标B为2，辅助柱子C为3
#define A 1
#define B 2
www.eeworm.com/read/480097/1323051
txt 陈顺凡-4.8分.txt
#include
#include
using namespace std;
//定义载量类
template
class Loading
{
friend Type MaxLoading(Type[],Type,int);
public:
void Backtrack(int i);
int n;
www.eeworm.com/read/480097/1323053
txt 李道强-6分.txt
#include
#include
class Color{
friend int mColoring(int,int,int **);
private:
bool Ok(int k);
void Backtrack(int t);
int n,m,**a,*x;
long sum;
};
www.eeworm.com/read/480097/1323059
txt 李道强-6分.txt
#include
#include
#include
#include
template
void swap(Type &a,Type &b)
{
Type t=a;
a=b;
b=t;
}
const unsigned long maxshort=6
www.eeworm.com/read/480097/1323062
txt 马航飞-6分.txt
#include
#include
#include
#include
#include
void swap(int *i,int *j)
{
int k;
k=*i;
*i=*j;
*j=k;
}
int partition(i
www.eeworm.com/read/480097/1323064
txt 陈顺凡-6分.txt
#include
#include
using namespace std;
int *s; //定义动态数组－存储各堆石子的数量
int *sMin;
int k;
void sift(int first , int length)
{//调整序列s[first..length]使之满足堆排序的性质。
int
www.eeworm.com/read/480097/1323069
txt 吴小菁-6分.txt
#include
#include
#include
#include
//using namespace std;
ofstream out("output.txt");
ifstream in("input.txt",ios::nocreate);
//int **c,**b;
void