代码搜索：while
找到约 10,000 项符合「while」的源代码
代码结果 10,000
www.eeworm.com/read/482358/6623271
c 2410lib.c
#include
#include
#include
#include
#include
#include "s3c2410.h"
#include "s3c2410sio.h"
#include "2410lib.h"
/*#include "mmu.h"*/
/*=
www.eeworm.com/read/482399/6624238
cpp wait.cpp
#include
#include
#include
using namespace std;
ifstream in("input.txt");
ofstream out("output.txt");
int Max(int a[],int n)
{
int pos=0;
for(int i=0;i
www.eeworm.com/read/482399/6624261
cpp tape.cpp
#include "iomanip"
#include "fstream"
#include "iostream"
using namespace std;
void Merge(double c[],double d[],int l,int m,int r)
{
int i=l,j=m+1,k=l;
while((i
www.eeworm.com/read/482102/6626696
c bo4-3.c
/* bo4-3.c 串采用块链存储结构(由c4-3.h定义)的基本操作(16个) */
void InitString(LString *T)
{ /* 初始化(产生空串)字符串T。另加 */
(*T).curlen=0;
(*T).head=NULL;
(*T).tail=NULL;
}
Status StrAssign(LString *T,ch
www.eeworm.com/read/482178/6628855
c 2410lib.c
//===================================================================
// File Name : 2410lib.c
// Function : S3C2410 PLL,Uart, LED, Port Init
// Program : Shin, On Pil (SOP)
// Date : Marc
www.eeworm.com/read/481848/6631639
cpp 各种排序.cpp
#include
#include
using namespace std;
void DreInsertSort(int a[],int n)
{
int t,m,k;
for(int i=1;i=0;j--)
{
if(a[i]>a[j])
break;
www.eeworm.com/read/481866/6631793
m simu2.m
clear
cs=100;
for j=1:cs
j
w(j)=0;
i=2;
x(i)=exprnd(10);
c(i)=x(i);
b(i)=x(i);
while b(i)
www.eeworm.com/read/481966/6633463
cpp 1080.cpp
/* This Code is Submitted by wywcgs for Problem 1080 on 2005-03-05 at 18:32:08 */
#include
int main()
{
int root, i, j, a[11];
while(1){
root = 0;
fo
www.eeworm.com/read/481966/6633507
cpp 1069.cpp
/* This Code is Submitted by wywcgs for Problem 1069 on 2005-10-28 at 12:50:45 */
#include
#include
const int N_MAX = 3600;
const int MAX = 32768;
int main()
{
int p[N
www.eeworm.com/read/481966/6633538
cpp 1525.cpp
/* This Code is Submitted by wywcgs for Problem 1525 on 2005-10-30 at 04:11:51 */
#include
const long MAX = 102400;
int main()
{
long stack[MAX], top;
long left[MAX], right[MAX]