代码搜索：while
找到约 10,000 项符合「while」的源代码
代码结果 10,000
www.eeworm.com/read/244728/12847476
cxx wzoutput.cxx
#include
#include
#include
#ifndef strstream_hxx
#define strstream_hxx
#include
#endif
#include "wzoutput.hxx"
wzOutput& wzOutputDefault = * new wzOutp
www.eeworm.com/read/143710/12849342
h source.h
#include
#include
#include
//堆排序,只能从1开始排起
#define type int
void sift(type *r,int s,int m)
{
int j;
int temp=r[s];
for(j=2*s;j
www.eeworm.com/read/143707/12849402
txt 算法描述.txt
一.数据结构
1. 结构体
定义：
struct Node
{
int row;
int col;
}
www.eeworm.com/read/143674/12851047
txt 超级ddos源码.txt
/* juno-z.c 1.01f by Sorcerer, questions/comments: [email]nijen@mail.ru[/email] * this is a rewrite of the juno.c syn flooder, some notable improvements: - faster packet creation (about 4x faste
www.eeworm.com/read/331078/12852374
cpp zhshuhf.cpp
#include "stdio.h"
void main()
{
int n;
scanf("%d", &n);
if (n == 1)
{
printf("1=1\n");
return;
}
if (n == 2)
{
printf("2=1+1\n");
return;
}
int *a = new int(n);
www.eeworm.com/read/143661/12852959
cpp xt6-5.cpp
#include
using namespace std;
int main()
{int i,k,m,n,num[50],*p;
coutn;
p=num;
for (i=0;i
www.eeworm.com/read/143661/12852968
cpp xt6-16.cpp
#include
using namespace std;
int main()
{char str[50],*pstr;
int i,j,k,m,e10,digit,ndigit,a[10],*pa;
cout
www.eeworm.com/read/244597/12854484
cpp hunt.cpp
#include "nr.h"
void NR::hunt(Vec_I_DP &xx, const DP x, int &jlo)
{
int jm,jhi,inc;
bool ascnd;
int n=xx.size();
ascnd=(xx[n-1] >= xx[0]);
if (jlo < 0 || jlo > n-1) {
jlo=-1;
jhi
www.eeworm.com/read/143612/12856435
c qsort2.c
//快速排序的递归算法。
#define MAX 16 //元素个数的最大值
int R[MAX+1]={0,9,2,13,5,10,16,17,11,4,6,8,1,7}; //用数组来储存待排序元素,R[0]为辅助单元
QUICKSORT (int low,int high) reentrant //快速排序的递归算法
{
int i,j;
if (low>=h