代码搜索:while

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

代码结果 10,000
www.eeworm.com/read/304991/13781283

v loop2.v

module loop2; integer i; initial begin i=0; while(i
www.eeworm.com/read/304990/13781362

v loop2.v

module loop2; integer i; initial begin i=0; while(i
www.eeworm.com/read/304989/13781441

v loop2.v

module loop2; integer i; initial begin i=0; while(i
www.eeworm.com/read/304988/13781520

v loop2.v

module loop2; integer i; initial begin i=0; while(i
www.eeworm.com/read/304987/13781599

v loop2.v

module loop2; integer i; initial begin i=0; while(i
www.eeworm.com/read/304883/13783878

htm 9-12.cfm.htm

使用循环(for
www.eeworm.com/read/304690/13789184

txt 算最大公因数.txt

int GCF(int a,int b) { int t; if(b>a) b=b%a; while(b!=0) { t=a%b; a=b; b=t; } return a; } void main() { int a,b; while() { input a; if(a=
www.eeworm.com/read/304690/13789185

txt 整数分解因子.txt

int LF(int n) //此函数返回n的最小非1因子 { if(n%2==0) return 2; int i=3; while(i
www.eeworm.com/read/304690/13789190

df

// f:df // FC2.2 翻译 “整数分解因子.txt” 产生 // 版权所有 ZKF 2003.05 // 注意:请检查所定义的数组的长度,若不是定值请改写为动态申请形式 #include #include int lf(int n) { if(n%2==0) return 2; int i=3;
www.eeworm.com/read/304690/13789191

txt 自然对数的底.txt

void main() { double e=1.0,d=1; int i=1; while(i