代码搜索：while
找到约 10,000 项符合「while」的源代码
代码结果 10,000
www.eeworm.com/read/275837/10792823
c 12max1.c
#include "math.h"
void max1(x,eps,k,js,f)
void (*f)();
int k,js[2];
double eps,x[2];
{ int i,j,m,jt;
double xx,h1,h2,dx,y[10],b[10],z[2];
js[0]=0; jt=1; h2=0.0;
whil
www.eeworm.com/read/275837/10793383
c 15cqck.c
#include "15cbub.c"
void cqck(p,n)
int n;
char p[];
{ int m,i0,*i;
char *s;
void csplit();
i=&i0;
if (n>10)
{ csplit(p,n,i);
m=i0;
cqck(p,m
www.eeworm.com/read/275837/10793405
c 15ihap.c
void ihap(p,n)
int n,p[];
{ int i,mm,t;
void isift();
mm=n/2;
for (i=mm-1; i>=0; i--)
isift(p,i,n-1);
for (i=n-1; i>=1; i--)
{ t=p[0]; p[0]=p[i]; p[i]=t;
www.eeworm.com/read/275837/10793479
c 15rhap.c
void rhap(p,n)
int n;
double p[];
{ int i,mm;
double t;
void rsift();
mm=n/2;
for (i=mm-1; i>=0; i--)
rsift(p,i,n-1);
for (i=n-1; i>=1; i--)
{ t=p[0
www.eeworm.com/read/275837/10793507
c 15iqck.c
#include "15ibub.c"
void iqck(p,n)
int n,p[];
{ int m,i0,*i,s0,*s;
void isplit();
i=&i0;
if (n>10)
{ isplit(p,n,i);
m=i0;
iqck(p,m);
s=p+(i0+1);
www.eeworm.com/read/275837/10793508
c 15rqck.c
#include "15rbub.c"
void rqck(p,n)
int n;
double p[];
{ int m,i0,*i;
double *s;
void rsplit();
i=&i0;
if (n>10)
{ rsplit(p,n,i);
m=i0;
rqck
www.eeworm.com/read/275837/10793509
c 15chap.c
void chap(p,n)
int n;
char p[];
{ int i,mm;
char t;
void csift();
mm=n/2;
for (i=mm-1; i>=0; i--)
csift(p,i,n-1);
for (i=n-1; i>=1; i--)
{ t=p[0]; p
www.eeworm.com/read/275837/10793510
c 15hqck.c
#include "15hbub.c"
void hqck(p,n,k,m)
int n,k,m;
char *p[];
{ int i0,*i;
void hsplit();
i=&i0;
if (kn-1) m=n-1;
if (m-k>10)
{ hsplit(p,k
www.eeworm.com/read/420478/10793714
cpp 1146subset of several questions.cpp
#include
using namespace std;
#include
int len;
int sum;
int data[100000]; // 数据.
char output[100000]; // 所求子集元素，与输入数据对应，'Y'为取.
void GetInput(){
int i;
cin >> len
www.eeworm.com/read/420440/10795898
c dhkz21_8.c
////////////////////////////////////////////////////////////////
//程序名称：DHKZ21.c //
//程序功能：普通阻焊程序 //
//运行环境：时钟频率6MHz，机器