代码搜索：while
找到约 10,000 项符合「while」的源代码
代码结果 10,000
www.eeworm.com/read/443457/7633023
cpp 1213.cpp
#include
#include
int main ()
{
int A[1000];
int i,t,x,n,m,a,b,count,tst,co;
scanf("%d",&tst);
co=0;
while (co0)
getchar();
scanf("%
www.eeworm.com/read/442891/7642696
cpp 5-2筛法求素数.cpp
//5-2 求100以内的素数
#include
#include
void main()
{
int c,d,k,prime[101];
for (c=2;c
www.eeworm.com/read/442831/7643920
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/442831/7643926
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/442831/7643928
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/442831/7643938
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/442831/7643953
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/442831/7644025
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/442831/7644033
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/442831/7644034
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--)