代码搜索：malloc
找到约 10,000 项符合「malloc」的源代码
代码结果 10,000
www.eeworm.com/read/299792/7832004
c 10hamg.c
#include "stdlib.h"
#include "math.h"
void hamg(t,h,n,y,eps,k,z,f)
void (*f)();
int n,k;
double t,h,eps,y[],z[];
{ void rkt();
int i,j,m;
double a,q,*b,*d,*u,*v,*w,*g;
www.eeworm.com/read/299792/7832014
c 10pbs.c
#include "stdlib.h"
#include "math.h"
void pbs(t,h,n,y,eps,f)
void (*f)();
int n;
double t,h,eps,y[];
{ void rkt();
int i,j,k,m,nn,it;
double x,hh,dd,q,p,g[10],*b,*d,
www.eeworm.com/read/299792/7832033
c 10adms.c
#include "stdlib.h"
#include "math.h"
void adms(t,h,n,y,eps,k,z,f)
void (*f)();
int n,k;
double t,h,eps,y[],z[];
{ void rkt();
int i,j,m;
double a,q,*b,*e,*s,*g,*d;
www.eeworm.com/read/299792/7832035
c 10wity.c
#include "stdlib.h"
void wity(t,y,n,h,k,z,f)
void (*f)();
int n,k;
double t,h,y[],z[];
{ int i,j;
double x,*a,*d;
a=malloc(n*sizeof(double));
d=malloc(n*sizeof(doubl
www.eeworm.com/read/299792/7832041
c 10gil.c
#include "stdlib.h"
#include "math.h"
void gil(t,h,y,n,eps,q,f)
void (*f)();
int n;
double t,h,eps,y[],q[];
{ int i,j,k,m,ii;
double x,p,hh,r,s,t0,dt,qq,*d,*u,*v,*g;
s
www.eeworm.com/read/299792/7832227
c 4ssgj.c
#include "stdlib.h"
#include "math.h"
#include "stdio.h"
int ssgj(a,n)
int n;
double a[];
{ int i,j,k,m;
double w,g,*b;
b=malloc(n*sizeof(double));
for (k=0; k
www.eeworm.com/read/299792/7832243
c 9mtml.c
#include "stdlib.h"
#include "math.h"
#include "3rnd1.c"
double mtml(n,a,b,f)
int n;
double a[],b[],(*f)();
{ int m,i;
double r,s,d,*x;
x=malloc(n*sizeof(double));
www.eeworm.com/read/299792/7832412
c 15topo.c
#include "stdlib.h"
void topo(n,r,m,p)
int n,m,p[],r[];
{ int top,i,j,k,t,*s,*g,*f;
struct node
{ int suc;
int next;
} *q;
q=(struct node *)malloc(m*sizeo
www.eeworm.com/read/299792/7832445
c 13lman.c
#include "stdlib.h"
#include "4rinv.c"
int lman(n,m,k,f,q,r,h,y,x,p,g)
int n,m,k;
double f[],q[],r[],h[],y[],x[],p[],g[];
{ int i,j,kk,ii,l,jj,js;
double *e,*a,*b;
e=mallo
www.eeworm.com/read/299791/7832472
cpp 高斯消去法解n维的线性方程组的小程序.cpp
//高斯消去法解n维的线性方程组的小程序
//运行时先输入阶数n,再输入系数行列式p[n][n]，然后是输
//入常数列向量b[n].屏幕会输出消元前后的增广矩阵和解。
//该程序Turbo C2.0通过。
#include
double tabs(double x)
{
x=x>0?x:-x;
return x;
}
m