代码搜索：malloc
找到约 10,000 项符合「malloc」的源代码
代码结果 10,000
www.eeworm.com/read/421976/10673369
c euler.c
#include "stdio.h"
#include "stdlib.h"
#include
int Func(y,d)
double y[],d[];
{
d[0]=y[1]; /*y0'=y1*/
d[1]=-y[0]; /*y1'=y0*/
d[2]=-y[2]; /*y2'=y2*/
return(1);
}
void E
www.eeworm.com/read/421976/10673394
c grkt10.c
#include "stdio.h"
#include "stdlib.h"
void RKT(t,y,n,h,k,z)
int n; /*微分方程组中方程的个数，也是未知函数的个数*/
int k; /*积分的步数(包括起始点这一步)*/
double t; /*积分的起始点t0*/
double h; /*积分的步长*/
double y[]; /
www.eeworm.com/read/276814/10706570
c haffmantree.c
#include
#include
#include
#include "conio.h"
#define ok 1
#define error 2
int m,s1,s2,n,k;
typedef struct {
unsigned int weight;
www.eeworm.com/read/349916/10782342
c memory.c
/*----------------------------------------------------------------------------*/
/* memory.c - memory management routines for sga code */
/*----------------------------------
www.eeworm.com/read/420652/10782858
txt 南京-金华业.txt
1.父类有虚函数，子类是否能实现多态？
2.随机输入一个字符串，并使它倒置输出，用C++
3 下列写法那种正确，为什么？
if(n == 10)
if(10 == n)
4,写出下列结果
char[] a = "word" cout
www.eeworm.com/read/275837/10792616
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/275837/10792658
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/275837/10792811
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/275837/10792948
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/275837/10792958
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