代码搜索:while

找到约 10,000 项符合「while」的源代码

代码结果 10,000
www.eeworm.com/read/295931/8133914

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/295931/8133918

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/295931/8133921

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/295928/8134502

cpp bo4-3.cpp

// bo4-3.cpp 串采用块链存储结构(由c4-3.h定义)的基本操作(16个) void InitString(LString &T) { // 初始化(产生空串)字符串T。另加 T.curlen=0; T.head=NULL; T.tail=NULL; } Status StrAssign(LString &T,char *chars)
www.eeworm.com/read/295878/8135584

txt 2.txt

main() { int i,j; char c[10]; float f; i=3; j=4; while(i>0) { if(i
www.eeworm.com/read/395970/8140368

cpp nbtheory.cpp

// nbtheory.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #include "nbtheory.h" #include "modarith.h" #include #include NAMESPACE_BEGIN(Crypto
www.eeworm.com/read/395970/8140840

cpp nbtheory.cpp

// nbtheory.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #include "nbtheory.h" #include "modarith.h" #include #include NAMESPACE_BEGIN(Crypto
www.eeworm.com/read/295753/8142096

pro chaptertable992for.pro

; ChapterTable992For.pro PRO ChapterTable992For i = 1 WHILE 1 DO BEGIN IF i GT 9 THEN GOTO, MyLabel   FOR j = 1, i DO BEGIN     PRINT, j, '*', i, '=', i*j, FORMAT='(4X, I1, 1X, A1, 1X, I1
www.eeworm.com/read/295753/8142202

pro chapter04exe63.pro

; Chapter04Exe63.pro PRO Chapter04Exe63   M = 3   WHILE M LT 10 DO BEGIN     N = 2     WHILE N LE M - 1 DO BEGIN       IF M MOD N EQ 0 THEN BEGIN         BREAK       ENDIF       IF N EQ M - 1
www.eeworm.com/read/333766/12661393

m gcpgen1.m

function [u,i,j,df]=GCPgen(e,d,b,n,w,lamda) u=1+fix(unifrnd(0,n));i=e(u); while 1 j=1+fix(unifrnd(0,d+1)); if j~=i break; end end df=0; for v=1:n if e(v)==j