代码搜索：while
找到约 10,000 项符合「while」的源代码
代码结果 10,000
www.eeworm.com/read/361569/10044913
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/361569/10044965
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/361569/10045378
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/361569/10045404
c 15hbub.c
#include "string.h"
void hbub(p,n,k,m)
char *p[];
int k,m,n;
{ int j,i;
char *d;
if (kn-1) m=n-1;
while (k
www.eeworm.com/read/361569/10045407
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/361569/10045510
c 3rab1.c
int rab1(a,b,r)
int a,b,*r;
{ int k,l,m,i,p;
k=b-a+1; l=2;
while (l
www.eeworm.com/read/361386/10055473
break
/* ESEMPIO BREAK */
let
var a:= 0
in
1+1;
for i:=0 to 100 do (break;
while (10>4) do (5+5;break;);
for c:=0 to 20 do (a:=a+1;();break;));
end
www.eeworm.com/read/165192/10072756
l .l
"/*" {char c;
int done=FALSE;
int i=-2;
ECHO;
do{while((c==' ')) i++;do{while(i>=0) printf(" ");
}while(!done);
}while(!done);
}
www.eeworm.com/read/164963/10080262
cpp 1205.cpp
/*1205*/
#include
#include
int main()
{
int n,w,i,j,num[2][101],a[101],b[2],sum;
char str[2][101],ch,bh;
for(i=0;i
www.eeworm.com/read/360443/10092119
txt two.txt
二插法已知：F(x1,x2)=4*x1-x2的平方-12；求极小值，极小值点，迭代次数？
用复合形法求极值。
约束条件：x2>=0;
x1>=0;
25-x1的平方-x2的平方>=0;
#include
#include
#define EP 0.0001
#define