代码搜索:malloc

找到约 10,000 项符合「malloc」的源代码

代码结果 10,000
www.eeworm.com/read/295931/8133419

c 4rinv.c

#include "stdlib.h" #include "math.h" #include "stdio.h" int rinv(a,n) int n; double a[]; { int *is,*js,i,j,k,l,u,v; double d,p; is=malloc(n*sizeof(int)); js=mallo
www.eeworm.com/read/295931/8133644

c 4rinv.c

#include "stdlib.h" #include "math.h" #include "stdio.h" int rinv(a,n) int n; double a[]; { int *is,*js,i,j,k,l,u,v; double d,p; is=malloc(n*sizeof(int)); js=mallo
www.eeworm.com/read/295931/8133990

c 4rinv.c

#include "stdlib.h" #include "math.h" #include "stdio.h" int rinv(a,n) int n; double a[]; { int *is,*js,i,j,k,l,u,v; double d,p; is=malloc(n*sizeof(int)); js=mallo
www.eeworm.com/read/333715/12663401

c brinv.c

#include "stdlib.h" #include "math.h" #include "stdio.h" int brinv(a,n) int n; double a[]; { int *is,*js,i,j,k,l,u,v; double d,p; is=malloc(n*sizeof(int)); js=mall
www.eeworm.com/read/332504/12752202

c ex12.c

// file 全选主元高斯-若尔当消去法实矩阵求逆 #include "stdlib.h" #include "math.h" #include "stdio.h" int rinv(n,a) //返回一个整型标志。若返回0,表示矩阵奇异;否则表示正常返回; int n; //矩阵阶数 double a[]; //存放原
www.eeworm.com/read/245311/12804723

cpp bruml.cpp

#include "stdlib.h" #include "math.h" #include "stdio.h" int brinv(a, n) int n; double a[]; { int *is,*js,i,j,k,l,u,v; double d,p; is=malloc(n*sizeof(int)); js=mal
www.eeworm.com/read/245311/12804793

c brinv.c

#include "stdlib.h" #include "math.h" #include "stdio.h" int brinv(double a[], int n) // int n; // double a[]; { int *is,*js,i,j,k,l,u,v; double d,p; is=(int *)malloc(n*s
www.eeworm.com/read/329181/12972178

h readsgy.h

#include "windows.h" #include "math.h" #include "stdio.h" #include "winbase.h" #include "string.h" #include "malloc.h"
www.eeworm.com/read/329181/12972309

h readsgy.h

#include "windows.h" #include "math.h" #include "stdio.h" #include "winbase.h" #include "string.h" #include "malloc.h"
www.eeworm.com/read/141595/12995425

c 4rinv.c

#include "stdlib.h" #include "math.h" #include "stdio.h" int rinv(a,n) int n; double a[]; { int *is,*js,i,j,k,l,u,v; double d,p; is=malloc(n*sizeof(int)); js=mallo