代码搜索：while
找到约 10,000 项符合「while」的源代码
代码结果 10,000
www.eeworm.com/read/362941/9974152
c pstr.c
/*
* 68K/386 32-bit C compiler.
*
* copyright (c) 1997, David Lindauer
*
* This compiler is intended for educational use. It may not be used
* for profit without the express written cons
www.eeworm.com/read/167159/9979352
cpp c24.cpp
// c24.cpp : Defines the entry point for the console application.
//
#include "stdafx.h"
#include
#include
int main(int argc, char* argv[])
{
int a[30]={0};
int
www.eeworm.com/read/362573/9990580
cpp zoj2666.cpp
#include
using namespace std;
int count(int m, int i){
int ret = 0;
while (m % i == 0) {
m /= i;
ret++;
}
return ret;
}
int n, m;
int p[1000]
www.eeworm.com/read/362570/9990806
cpp poj1258.cpp
#include
int main()
{
int n, ans;
int i, j, min;
int g[100][100];
int d[100];
int mk[100];
while (scanf("%d", &n)!= EOF && n)
{
for (i =
www.eeworm.com/read/362558/9992243
txt t2.txt
/*方法一采用简单选择排序思想*/
void Sort (int L[], int n)
/ * 条块颜色依次存放在L[0..n-1]中，本算法利用简单选择排序思想，将整个序列按红、白、蓝进行排序。* /
{
int i, j, x;
i=0; / * i指向第一个红色条块应该放的位置 * /
for (j=i; j
www.eeworm.com/read/362558/9992768
txt 6_16.txt
BiTNode* TinFirst(BiTree root)
{
BiTNode *p;
p = root;
if(p)
while(p->LChild!=NULL)
p=p->LChild;
return p;
}
www.eeworm.com/read/362550/9993131
c time.c
#include "time.h"
void Delay(unsigned char uS)
{
while(--uS)
{
;
}
}
www.eeworm.com/read/166717/10006091
bak sort.bak
//排序算法
//by lordor 2005.08.20
#include "stdafx.h"
//数据结构
const int maxsize=100; //排序表容量，假设为100
typedef int datatype; //假设关键字为int
typedef struct {
datatype key; //关键字域
// othertype oth
www.eeworm.com/read/166573/10015837
c pstr.c
/*
* 68K/386 32-bit C compiler.
*
* copyright (c) 1997, David Lindauer
*
* This compiler is intended for educational use. It may not be used
* for profit without the express written cons