代码搜索：while
找到约 10,000 项符合「while」的源代码
代码结果 10,000
www.eeworm.com/read/462729/7197373
txt ch6_4.txt
void toposort(TD g[],int n)
{ int top,m,k,j;
JD *p;
top=0; m=0;
for(j=1;j0)
{ j=top;
www.eeworm.com/read/462726/7197465
txt ch2_3.txt
JD *dlbcz(JD *h,int x)
{ JD *p;
p=h;
while(p!=NULL && p->data!=X)
p=p->link;
return (p);
}
www.eeworm.com/read/462721/7197499
txt ch2_3.txt
JD *dlbcz(JD *h,int x)
{ JD *p;
p=h;
while(p!=NULL && p->data!=X)
p=p->link;
return (p);
}
www.eeworm.com/read/462042/7211854
txt 代码27-10.txt
if (A && B)
if (A || B)
while (b ~= 0) && (a/b > 18.5)
if exist('myfun.m') && (myfun(x) >= y)
if iscell(A) && all(cellfun('isreal', A))
www.eeworm.com/read/461731/7220984
c bisect.c
#include
#include
bisection()
{
int i, count = 0;
float a,b,x,fa,fb,fx,tol;
printf(" \n Given equation is 2*x^2-1");
printf("\n Enter the value of a and b : ");
scanf("%f %f", &a
www.eeworm.com/read/461470/7226991
cpp tx1053.cpp
#include
#include
typedef struct
{
char c;
int n;
int set;
}node;
void main()
{
int length,i,j,t,k,count[10000],sum,min1,min2,flag,k0,len[10000],t0,t
www.eeworm.com/read/461468/7227006
cpp tx10512.cpp
#include
int main()
{
int m,n,i,j,L[5000],W[5000],k,t,r,c,b;
while(scanf("%d",&n)!=EOF)
{
for(i=1;i
www.eeworm.com/read/461343/7228926
txt chengxu.txt
int a;
int b;
int fun1(int a,int b)
{
a=a+5;
b=b+2;
if(a>8)
{
while(b>0)
b=b-2;
a=a+b;
}
return a;
}
int main()
{
int c;
int d;
a=5;
b=a;
c=a*(a+b);
d=fun1(a,c);
www.eeworm.com/read/460871/7239031
m untitled.m
while true
q=input('enter the answer:');
if q=='y'
break
else
break
end
end
www.eeworm.com/read/460783/7240717
txt 布尔母函数.txt
//布尔母函数
//判m[]个价值为w[]的货币能否构成value
//适合m[]较大w[]较小的情况
//返回布尔量
//传入货币种数n,个数m[],价值w[]和目标值value
#define MAXV 100000
int genfunc(int n,int* m,int* w,int value){
int i,j,k,c;
char r[MAXV];
for