代码搜索：while
找到约 10,000 项符合「while」的源代码
代码结果 10,000
www.eeworm.com/read/267227/11189281
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/267227/11189303
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/267227/11189309
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/267227/11189821
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/267227/11189843
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/266535/11220448
cc fiber.cc
// Problem Fiber Network
// Algorithm Floyd-Warshall, Transitive Hull, Bit Encoding
// Runtime O(n^3)
// Author Walter Guttmann
// Date 10.05.2001
#include
#include
#in
www.eeworm.com/read/265929/11249603
txt test1_5.txt
main ( )
{
int m=1,j=6;
while(m) /* m不等于0，为真*/
{
j=j+m;
m =m-1;
}
printf(“%d”,j);
}
www.eeworm.com/read/265929/11249739
txt test1_5.txt
main ( )
{
int m=1,j=6;
while(m) /* m不等于0，为真*/
{
j=j+m;
m =m-1;
}
printf(“%d”,j);
}
www.eeworm.com/read/335971/12485880
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);
}