代码搜索:while

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

代码结果 10,000
www.eeworm.com/read/275035/10838445

c twodim.c

# include void main() { int array[16][16]; int i, j, k, m, n; /* 变量初始化 */ m = 1; while(m == 1) { printf("请输入n(0
www.eeworm.com/read/275022/10838636

c 8atk.c

#include "math.h" double atk(x,y,n,t,eps) int n; double t,eps,x[],y[]; { int i,j,k,m,l; double z,xx[10],yy[10]; z=0.0; if (n
www.eeworm.com/read/275022/10838761

c 15ikey.c

void ikey(p,n,k,m) int n,k,m; HEAPSORT *p[]; { int i,l; HEAPSORT *w; void pisift(); if (kn-1) m=n-1; l=m-k+1; for (i=l/2-1; i>=0; i--)
www.eeworm.com/read/275022/10838777

c 15ckey.c

void ckey(p,n,k,m) int n,k,m; HEAPSORT *p[]; { int i,l; HEAPSORT *w; void pcsift(); if (kn-1) m=n-1; l=m-k+1; for (i=l/2-1; i>=0; i--)
www.eeworm.com/read/275022/10838782

c 16cbkey.c

int cbkey(p,n,a,b,m) int n,*m; BISERCH *p[]; char a,b; { int i,j,k; i=1; j=n; while (i=a)&&((*p[k-1]).KEY
www.eeworm.com/read/275022/10838814

c 16rbkey.c

int rbkey(p,n,a,b,m) int n,*m; BISERCH *p[]; double a,b; { int i,j,k; i=1; j=n; while (i=a)&&((*p[k-1]).KEY
www.eeworm.com/read/275022/10838854

c 12cplx.c

#include "stdlib.h" int cplx(n,m,a,b,alpha,eps,x,xx,k,s,f) int n,m,k; void (*s)(); double a[],b[],alpha,eps,x[],xx[],(*f)(); { double rn(double *); int r,g,i,j,it,kt,jt,kk;
www.eeworm.com/read/275022/10838934

c 5sstq.c

#include "stdio.h" #include "math.h" int sstq(n,b,c,q,eps,l) int n,l; double b[],c[],q[],eps; { int i,j,k,m,it,u,v; double d,f,h,g,p,r,e,s; c[n-1]=0.0; d=0.0; f=0.0;
www.eeworm.com/read/419764/10839241

cpp shudu.cpp

/*回溯法求解数独问题*/ # include int a[10][10]={{0,0,0,0,0,0,0,0,0,0}, {0,0,0,3,8,1,0,0,0,9}, {0,5,0,0,4,0,0,0,8,0}, {0,0,6,0,9,0,0,1,0,0},
www.eeworm.com/read/275022/10839442

c 15ikey.c

void ikey(p,n,k,m) int n,k,m; HEAPSORT *p[]; { int i,l; HEAPSORT *w; void pisift(); if (kn-1) m=n-1; l=m-k+1; for (i=l/2-1; i>=0; i--)