代码搜索：while
找到约 10,000 项符合「while」的源代码
代码结果 10,000
www.eeworm.com/read/489978/6464818
txt 123.txt
＃i nclude
#define uchar unsigned char
#define uint unsigned int
uchar zhishi[]={0xc0,0xf9,0xa4,0xb0,0x99,0x92,0x82,0xf8,0x80,0x90}; /*显示码*/
uint a,b;
bit mod=1;
uchar i,j;
void jian
www.eeworm.com/read/400720/6465568
c sh102.c
#include
#define uint unsigned int
sbit gate1=P2^0; // 定义P2-0口
sbit gate2=P2^1; // 定义P2-1口
sbit gate3=P2^2; // 定义P2-2口
sbit gate4=P2^3; // 定义P2-3口
void main(v
www.eeworm.com/read/400720/6465572
c sh101.c
#include
sbit gate=P2^0; // 定义P2-0口
void main(void)
{
unsigned int i,j;
while(1)
{
for(i=1000;i>0;i--)
for(j=1000;j>0;j--); // 双重循环，延时约1秒
gate=!gate; // 对P-0口取反，控制小灯的
www.eeworm.com/read/489571/6465964
cpp bwfind.cpp
// Bwfind.cpp: implementation of the CBwfind class.
//
//////////////////////////////////////////////////////////////////////
#include "stdafx.h"
#include "bw.h"
#include "Bwfind.h"
#ifdef _
www.eeworm.com/read/489702/6468941
c lexyy.c
/*--------------------------------------------------------*/
/* Copyright (c) PSW-soft 1996 */
/* */
/* File: LEXY
www.eeworm.com/read/489219/6476851
c merge.c
/*****************************************/
/* 一次归并算法 */
/* 文件名merge.c,函数名merge() */
/*****************************************/
void merge(table *tabs,table *ta
www.eeworm.com/read/489302/6478101
txt input.txt
#include"string"
int main() {
int ab;
ab = 2;
if(ab == 1) {
return 1;
}
/*compare*/
int a = 2;
if(a != 2) {
return a;
}
while(a
www.eeworm.com/read/488974/6480795
c led.c
#include
unsigned char i;
unsigned char temp;
unsigned char a,b;
void delay(void)
{
unsigned char m,n,s;
for(m=20;m>0;m--)
for(n=20;n>0;n--)
for(s=248;s>0;s--);
}
void
www.eeworm.com/read/488746/6485096
cpp quicksort.cpp
#include
#include
void quicksort(int *,int ,int );
int split(int *,int ,int );
int n;
void display(int *a , int n)
{
int i;
printf("\narray is : ");
fo
www.eeworm.com/read/488830/6486548
c main.c
/******************************************************************************\
Project Version: MTKCARDVD()
********************************************************************************