代码搜索：while
找到约 10,000 项符合「while」的源代码
代码结果 10,000
www.eeworm.com/read/197671/7979448
c 3rabs.c
void rabs(a,b,r,p,n)
int a,b,*r,n,p[];
{ int k,l,m,i;
k=b-a+1; l=2;
while (l
www.eeworm.com/read/197671/7980008
c 3rabs.c
void rabs(a,b,r,p,n)
int a,b,*r,n,p[];
{ int k,l,m,i;
k=b-a+1; l=2;
while (l
www.eeworm.com/read/197671/7980033
c 3rabs.c
void rabs(a,b,r,p,n)
int a,b,*r,n,p[];
{ int k,l,m,i;
k=b-a+1; l=2;
while (l
www.eeworm.com/read/196428/8092591
c qrnd.c
# include "stdio.h"
void qrnd(a,b,r,p,n)
int a,b,*r,n,p[];
{ int k,l,m,i;
k=b-1+1;l=2;
while (l
www.eeworm.com/read/396243/8118379
m ex0108.m
function ex0108()
n = 1;
a=[9 2 4 3 5 6 8 0];
min=inf;
while n
www.eeworm.com/read/295931/8132957
c 16rsech.c
int rsech(p,k,m,a,b)
STRU p[];
double a,b;
int k,m;
{ int i;
i=k;
while ((im) return(-1);
return(i);
}
www.eeworm.com/read/295931/8133014
c 16ibkey.c
int ibkey(p,n,a,b,m)
int n,*m;
BISERCH *p[];
int a,b;
{ int i,j,k;
i=1; j=n;
while (i=a)&&((*p[k-1]).KEY
www.eeworm.com/read/195741/8133029
bak 找最大公约数.bak
input"输入M:" to m
input"输入N", to n
if n=0 then
?"数据有错！"
exit
endif
r=mod(m,n)
do while r>0
m=n
n=r
r=mod(m,n)
enddo
?"最大公约数是：",n
www.eeworm.com/read/295931/8133069
c 16csech.c
int csech(p,k,m,a,b)
STRU p[];
char a,b;
int k,m;
{ int i;
i=k;
while ((im) return(-1);
return(i);
}
www.eeworm.com/read/295931/8133085
c 3rabs.c
void rabs(a,b,r,p,n)
int a,b,*r,n,p[];
{ int k,l,m,i;
k=b-a+1; l=2;
while (l