代码搜索：while
找到约 10,000 项符合「while」的源代码
代码结果 10,000
www.eeworm.com/read/155688/11853325
cpp productmove.cpp
// ProductMove.cpp: implementation of the ProductMove class.
//
//////////////////////////////////////////////////////////////////////
#include "stdafx.h"
#include "chess.h"
#include "ProductMo
www.eeworm.com/read/155663/11856137
txt symbolrecord.txt
func 1
while 2
do 3
if 4
then 5
else 6
true 7
false 8
const 9
id 10
int 29
{ 11
} 12
; 13
, 14
= 15
! 16
& 17
| 18
< 19
> 20
= 22
23
== 24
+ 25
* 26
( 27
) 28
www.eeworm.com/read/155662/11856191
txt symbolrecord.txt
func 1
while 2
do 3
if 4
then 5
else 6
true 7
false 8
const 9
id 10
int 29
{ 11
} 12
; 13
, 14
= 15
! 16
& 17
| 18
< 19
> 20
= 22
23
== 24
+ 25
* 26
( 27
) 28
www.eeworm.com/read/344854/11856701
c clock.c
#include "iom64v.h"
#include "clock.h"
void Delay(int n)
{
unsigned int i;
i=0;
while(i++ < n);
}
/*void Init(void)
{
DIR_OUT;
SCL_OUT;
SCL_1;
Delay(5);
SDA_1;
www.eeworm.com/read/344854/11856721
c clock.c
#include "iom64v.h"
#include "clock.h"
void Delay(int n)
{
unsigned int i;
i=0;
while(i++ < n);
}
/*void Init(void)
{
DIR_OUT;
SCL_OUT;
SCL_1;
Delay(5);
SDA_1;
www.eeworm.com/read/344854/11856751
_c clock._c
#include "iom64v.h"
#include "clock.h"
void Delay(int n)
{
unsigned int i;
i=0;
while(i++ < n);
}
void Init(void)
{
DIR_OUT;
SCL_OUT;
SCL_1;
Delay(5);
SDA_1;
D
www.eeworm.com/read/155654/11856856
cpp 1014.cpp
#include
#include
int main(void)
{
int b,i;
char r[128];
while(scanf("%d",&b)!=EOF && b!=0){
scanf("%s",r);
int sum=0,n;
for(i=0;r[i]!='\0';i++){
sum+=r[i]-'0';
www.eeworm.com/read/344798/11859589
c mystring.c
//**********************************************************************************
//杨屹 2002/08/20 第一版
//字符串操作函数
//联系方法：gdtyy@ri.gdt.com.cn（2003/07/31以前有效）
//******************************
www.eeworm.com/read/155627/11859766
m zxysf3.m
clear
i=1;
sum1=0;
a=[0 1 1 0 0 0 0 0 1 0 0 0 1 0
0 0 0 0 0 0 0 1 0 0 1 1 0 0
0 1 0 1 0 0 0 0 0 1 0 0 0 0
0 0 1 0 0 0 0 1 0 0 0 1 0 0
0 0 0 0 0 0 0 0 0 0 1 0 1 1
0 0 0 0 1 1 0 0 0 0 0 0 0 0
0
www.eeworm.com/read/155627/11859807
asv zxysf.asv
clear
i=1;
sum1=0;
a=[0 1 1 0 0 0 0 0 1 0 0 0 1 0
0 0 0 0 0 0 0 1 0 0 1 1 0 0
0 1 0 1 0 0 0 0 0 1 0 0 0 0
0 0 1 0 0 0 0 1 0 0 0 1 0 0
0 0 0 0 0 0 0 0 0 0 1 0 1 1
0 0 0 0 1 1 0 0 0 0 0 0 0 0
0