代码搜索：stdlib
找到约 10,000 项符合「stdlib」的源代码
代码结果 10,000
www.eeworm.com/read/432144/8623869
c 6.13 求解线性最小二乘问题的豪斯赫尔德变换法 gmqr.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*sizeof(double
www.eeworm.com/read/432144/8624450
c 4.5 对称正定矩阵的求逆 ssgj.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/432144/8624791
c 10.4 全区间积分的定步长龙格-库塔方法 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/432144/8624816
c 10.3 全区间积分的维梯方法 wity.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/432144/8625034
c 9.15 计算多重积分的蒙特卡洛法 mtml.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/432039/8636446
c exit.c
#include
#include
int main()
{
printf("Using exit...\n");
printf("This is the content in buffer");
exit(0);
}
www.eeworm.com/read/432039/8636459
c execlp.c
#include
#include
#include
int main()
{
if(fork()==0){
if(execlp("ps","ps","-ef",NULL)
www.eeworm.com/read/432039/8636474
c execl.c
#include
#include
#include
int main()
{
if(fork()==0){
if(execl("/bin/ps","ps","-ef",NULL)
www.eeworm.com/read/431832/8651078
c zidian1.c
#include
#include
void main()
{
int count;
int Scount[10];
int doda;
int yee;
memset(Scount,0,sizeof(Scount));
cin>>count;
for(int i=1;i
www.eeworm.com/read/431721/8658791
c 7qrrt.c
#include "stdlib.h"
#include "5hhqr.c"
int qrrt(a,n,xr,xi,eps,jt)
int n,jt;
double a[],xr[],xi[],eps;
{ int i,j;
double *q;
q=malloc(n*n*sizeof(double));
for (j=0; j