代码搜索:JS

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

代码结果 10,000
www.eeworm.com/read/431721/8658968

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/431721/8659113

c 6gjdn.c

#include "stdlib.h" #include "math.h" #include "stdio.h" int gjdn(a,b,n,m) int n,m; double a[],b[]; { int *js,l,k,i,j,is,p,q; double d,t; js=malloc(n*sizeof(int));
www.eeworm.com/read/431721/8659209

c 6gaus.c

#include "stdlib.h" #include "math.h" #include "stdio.h" int gaus(a,b,n) int n; double a[],b[]; { int *js,l,k,i,j,is,p,q; double d,t; js=malloc(n*sizeof(int)); l=1
www.eeworm.com/read/431721/8659226

c 6ggje.c

#include "stdlib.h" #include "math.h" #include "stdio.h" int ggje(a,n,b) int n; double a[],b[]; { int *js,i,j,k,is,u,v; double d,t; js=malloc(n*sizeof(int)); for (
www.eeworm.com/read/431721/8659364

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/431721/8659485

c 4sdet.c

#include "math.h" double sdet(a,n) int n; double a[]; { int i,j,k,is,js,l,u,v; double f,det,q,d; f=1.0; det=1.0; for (k=0; k
www.eeworm.com/read/431721/8659489

c 4rank.c

#include "math.h" int rank(a,m,n) int m,n; double a[]; { int i,j,k,nn,is,js,l,ll,u,v; double q,d; nn=m; if (m>=n) nn=n; k=0; for (l=0; l
www.eeworm.com/read/431721/8659541

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/431721/8659547

c 4cinv.c

#include "stdlib.h" #include "stdio.h" int cinv(ar,ai,n) int n; double ar[],ai[]; { int *is,*js,i,j,k,l,u,v,w; double p,q,s,t,d,b; is=malloc(n*sizeof(int)); js=malloc
www.eeworm.com/read/431721/8659793

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