代码搜索：malloc
找到约 10,000 项符合「malloc」的源代码
代码结果 10,000
www.eeworm.com/read/186956/8888868
c queen.c
#include
#include
#include
int *site; //每行的棋子所放置的位置，下标从0开始
int queen; //皇后的数目
int count=0; //第几种放置的可能性
//判断第n+1行的放置是否合适
int IsOk(int n)
{
in
www.eeworm.com/read/284745/8903710
c rkt1.c
#include "stdlib.h"
void rkt1(t,y,n,h,k,z,f)
void (*f)();
int n,k;
double t,h,y[],z[];
{ int i,j,l;
double a[4],tt,*b,*d;
b=malloc(n*sizeof(double));
d=malloc(n*size
www.eeworm.com/read/284745/8903718
c rkt2.c
#include "stdlib.h"
#include "math.h"
void rkt2(t,h,y,n,eps,f)
void (*f)();
int n;
double t,h,eps,y[];
{ int m,i,j,k;
double hh,p,dt,x,tt,q,a[4],*g,*b,*c,*d,*e;
g=mall
www.eeworm.com/read/383932/8910557
txt mpowell.c.txt
mpowell.c代码如下：
#include "powell.c"
main()
{double p[]={1,2};
double ff,x[2];
ff=powell(p,0.3,0.001,0.0001,2,x);
printf("x[0]=%f,x[1]=%f,ff=%f\n",x[0],x[1],ff);
getch();
}
powell.c代码如下：
www.eeworm.com/read/383614/8932614
txt 链栈入栈算法.txt
JD *lzjz(JD *top,int x)
{ JD *p;
p=(JD *)malloc(sizeof(JD));
p->data=x;
p->link=top;
top=p;
return(top);
}
www.eeworm.com/read/427573/8934565
c 7ngin.c
#include "math.h"
#include "stdlib.h"
#include "6gmiv.c"
int ngin(m,n,eps1,eps2,x,ka,f,s)
void (*f)(),(*s)();
int m,n,ka;
double eps1,eps2,x[];
{ int i,j,k,l,kk,jt;
doubl
www.eeworm.com/read/427573/8934629
c 7netn.c
#include "stdlib.h"
#include "math.h"
#include "stdio.h"
#include "6gaus.c"
int netn(n,eps,t,h,x,k,f)
int n,k;
void (*f)();
double eps,t,h,x[];
{ int i,j,l;
double am,
www.eeworm.com/read/427573/8934890
c 12lplq.c
#include "stdlib.h"
#include "4rinv.c"
#include "4trmul.c"
int lplq(a,b,c,m,n,x)
int m,n;
double a[],b[],c[],x[];
{ int i,mn,k,j,l,*js;
double s,z,dd,y,*p,*d;
js=mall
www.eeworm.com/read/427573/8935098
c 6gmqr.c
#include "4maqr.c"
#include "stdlib.h"
int gmqr(a,m,n,b,q)
int m,n;
double a[],b[],q[];
{ int i,j;
double d,*c;
int maqr(double [],int,int,double []);
c=malloc(n*size
www.eeworm.com/read/427573/8935118
c 6grad.c
#include "4trmul.c"
#include "math.h"
#include "stdlib.h"
#include "stdio.h"
void grad(a,n,b,eps,x)
int n;
double a[],b[],x[],eps;
{ int i,k;
double *p,*r,*s,*q,alpha,bet