代码搜索:while
找到约 10,000 项符合「while」的源代码
代码结果 10,000
www.eeworm.com/read/169530/9852981
c jpsb.c
#include
unsigned char code table[]={0x3f,0x06,0x5b,0x4f,
0x66,0x6d,0x7d,0x07,
0x7f,0x6f,0x77,0x7c,
www.eeworm.com/read/169527/9853074
c jpsb.c
#include
unsigned char code table[]={0x3f,0x06,0x5b,0x4f,
0x66,0x6d,0x7d,0x07,
0x7f,0x6f,0x77,0x7c,
www.eeworm.com/read/169128/9880359
cpp mathstack.cpp
#include "StdAfx.h"
#include ".\MathStack.h"
#include
using namespace std;
// list of supported functions
char* pFunctions[] = {
"(",
"sin(",
"cos(",
"tan(",
"sec(",
www.eeworm.com/read/364635/9902540
c 44键盘.c
#include
unsigned char code table[]={0x3f,0x06,0x5b,0x4f,
0x66,0x6d,0x7d,0x07,
0x7f,0x6f,0x77,0x7c,
www.eeworm.com/read/364513/9904714
c recuit.c
#include
#include
#include
/**
* initialisation (Algorithme Glouton)
*/
float init(float* p, float* w, int* x ,int m, int n) {
int i = 0;
float s = 0;
www.eeworm.com/read/364450/9906284
cpp sort.cpp
/* Copyright (C) 1999 Lucent Technologies */
/* From 'Programming Pearls' by Jon Bentley */
/* sort.cpp -- test and time sorting algorithms
Input lines: algnum n mod
Output lines: algnum n mod
www.eeworm.com/read/364450/9906315
c rotate.c
/* Copyright (C) 1999 Lucent Technologies */
/* From 'Programming Pearls' by Jon Bentley */
/* rotate.c -- time algorithms for rotating a vector
Input lines:
algnum numtests n rotdist
algnum:
www.eeworm.com/read/168292/9923382
cpp 求解可达距阵.cpp
#include
#define t 50
void main()
{
while(1)
{
int a[t][t],m[t][t],b[t][t];
int i,j,k,q,w;
int count=1,number;
char ch;
printf("请输入距阵的阶数:\n");
sca
www.eeworm.com/read/167649/9957237
cpp quick.cpp
#include
#include
#include
#include "sqlist.h"
void main(void)
{void qksort(recordfile r,int s,int t); //快速排序算法
int n,i; time_t t;
recordfile r;
cout