代码搜索：while
找到约 10,000 项符合「while」的源代码
代码结果 10,000
www.eeworm.com/read/432650/8584497
lst gg.lst
C51 COMPILER V8.05a GG 10/04/2007 17:46:28 PAGE 1
C51 COMPILER V8.05a, COMPILATION OF MODULE GG
OBJECT MODULE PLACED IN gg.
www.eeworm.com/read/432650/8584531
c gg.c
//proteus仿真论坛：proteus.5d6d.com
#include
#include
#include
sbit DI=P2^2; // 数据\指令 选择
sbit RW=P2^1; // 读\写 选择
sbit E=P2^0; // 读\写使能
sbit CS1=P2^4; // 片选1
sbit C
www.eeworm.com/read/388674/8585988
cpp cross.cpp
#include
ifstream in;
ofstream out;
#define cin in
#define cout out
#include
int r,c,w;
#define MAXR 60
#define MAXC 60
#define MAXW 310
#define bool int
#define tr
www.eeworm.com/read/388569/8599967
cpp 1265 floating point presentation.cpp
#include
using namespace std;
int main()
{
int n,t,i,j,p;
unsigned int e ,m[23];
float f;
scanf("%d",&n);
while(n--)
{
scanf("%f",&f);
for(i=0;i
www.eeworm.com/read/388569/8600083
cpp 1628 roman roulette.cpp
#include
using namespace std;
int cir[101];
int main()
{
int i,j,n,k,now,die;
while( scanf("%d %d",&n ,&k)==2 && (n != 0 || k != 0))
{
for(i=1;i
www.eeworm.com/read/388569/8601193
cpp 1052 tian ji -- the horse racing.cpp
//贪心
#include
#include
using namespace std;
int n,m;
int t[1100],k[1100];
int main()
{
int i,j,i2,j2;
while(scanf("%d",&n)==1 && n)
{
for(i=0;i
www.eeworm.com/read/388569/8601234
cpp 1113 word amalgamation.cpp
/*
1113 Word Amalgamation
Time Limit : 1000 ms Memory Limit : 32768 K Output Limit : 5120 K
GUN C++
*/
#include
#include
using namespace std;
const int Max=101;
ch
www.eeworm.com/read/388460/8607378
bak 8.bak
main( )
{ int a[11] , l , h , m , y , x , *p ;
for ( y=1 ; y
www.eeworm.com/read/432144/8623697
c 12.5 求约束条件下n维极值的复形调优法 cplx.c
#include "stdlib.h"
int cplx(n,m,a,b,alpha,eps,x,xx,k,s,f)
int n,m,k;
void (*s)();
double a[],b[],alpha,eps,x[],xx[],(*f)();
{ double rn(double *);
int r,g,i,j,it,kt,jt,kk;
www.eeworm.com/read/432144/8623743
c 5.2 求对称三对角阵的全部特征值与特征向量 sstq.c
#include "stdio.h"
#include "math.h"
int sstq(n,b,c,q,eps,l)
int n,l;
double b[],c[],q[],eps;
{
int i,j,k,m,it,u,v;
double d,f,h,g,p,r,e,s;
c[n-1]=0.0; d=0.0; f=0.0;
for (j=0;