代码搜索：while
找到约 10,000 项符合「while」的源代码
代码结果 10,000
www.eeworm.com/read/407541/11416980
cpp 输入字符判断是字母或数字 问题.cpp
#include /**/
void main()
{
printf("\n\tIutput a character输入一个字符(空格结束)做判断: \n\n");
char c;
printf(" 输入一个字符: ");
c=getchar();
while(c!=' ') //上一行和本行合成 while((c=getchar())!
www.eeworm.com/read/407297/11422456
h hal.h
/******************************************************************************
* *
* **********
www.eeworm.com/read/405817/11456346
cpp a new change problem(互质数最大不可能数).cpp
#include
int main()
{
int a,b;
while (scanf("%d %d",&a,&b)==2) {
printf("%d %d\n", (a-1)*b - (a-1) -1,(a-1)*(b-1)/2);
}
}
www.eeworm.com/read/404684/11480368
cpp eclass.cpp
void eclass(int nf[], int n, int lista[], int listb[], int m)
{
int k,l,j;
for (k = 1; k
www.eeworm.com/read/404226/11489813
curry bad6.curry
void main() {
int xyz;
while (xyz) {
else
z = 24;
}
}
www.eeworm.com/read/402245/11540291
c text1.c
#include
sbit p1_0=p1^0;
void main(void)
{ while(1);
p1_0=1;
}
www.eeworm.com/read/348212/11605481
c delay.c
void delay(unsigned int x)
{
unsigned char j;
while(x--)
{
for(j=254;j;j--);
}
}
www.eeworm.com/read/158297/11627020
m primetest.m
function z=primetest(n);
% This function tests a number n for primeness.
% It uses the Miller-Rabin primality (compositeness) test
% z=1 means prime
% z=0 means composite
T=30; % hard coded amount of
www.eeworm.com/read/158107/11643192
cpp eclass.cpp
void eclass(int nf[], int n, int lista[], int listb[], int m)
{
int k,l,j;
for (k = 1; k