代码搜索：while
找到约 10,000 项符合「while」的源代码
代码结果 10,000
www.eeworm.com/read/195741/8133096
bak 找最小公倍数.bak
input"输入M:" to m
input"输入N" to n
a=m
b=n
if n=0 then
?"数据有错！"
exit
endif
r=mod(m,n)
do while r>0
m=n
n=r
r=mod(m,n)
enddo
?"最大公约数是：",n
?"最小公倍数是："，a*b/n
www.eeworm.com/read/195741/8133105
prg 找最小公倍数.prg
input"输入M:" to m
input"输入N" to n
a=m
b=n
if n=0 then
?"数据有错！"
exit
endif
r=mod(m,n)
do while r>0
m=n
n=r
r=mod(m,n)
enddo
?"最大公约数是：",n
?"最小公倍数是：",a*b/n
www.eeworm.com/read/195741/8133108
prg 找最大公约数.prg
input"输入M:" to m
input"输入N" to n
if n=0 then
?"数据有错！"
exit
endif
r=mod(m,n)
do while r>0
m=n
n=r
r=mod(m,n)
enddo
?"最大公约数是：",n
www.eeworm.com/read/295931/8133924
c 3rabs.c
void rabs(a,b,r,p,n)
int a,b,*r,n,p[];
{ int k,l,m,i;
k=b-a+1; l=2;
while (l
www.eeworm.com/read/295931/8133961
c 3rabs.c
void rabs(a,b,r,p,n)
int a,b,*r,n,p[];
{ int k,l,m,i;
k=b-a+1; l=2;
while (l
www.eeworm.com/read/246953/12695880
c ex4-22.c
#include
main() {
int x, *p, ** q;
x=10;
p=&x;
q=&p;
printf("%d\n:, x);
printf("%d\n:, * p);
printf("%d\n:, ** q);
while(1);
www.eeworm.com/read/246680/12712985
m ex0108.m
function ex0108()
n = 1;
a=[9 2 4 3 5 6 8 0];
min=inf;
while n
www.eeworm.com/read/145310/12736253
m pos_retmin1.m
function [p,i]=pos_retmin1(X)
n=length(X);
m=1;
q=0;
while m
www.eeworm.com/read/145250/12743215
tny test2.tny
{this is an example}
int A,B;
bool C;
char D;
D:='scanner';
C:=A and not B;
while A
www.eeworm.com/read/145241/12743819
txt ch8_2.txt
void binsort(JD r[],int n)
{ int i,j,x,s,m,k;
for(i=2;i