代码搜索:while

找到约 10,000 项符合「while」的源代码

代码结果 10,000
www.eeworm.com/read/164696/10094887

c ssp.c

/***************************************************************************** * ssp.c: SSP C file for Philips LPC214x Family Microprocessors * * Copyright(C) 2006, Philips Semiconductor
www.eeworm.com/read/163484/10157559

cpp cpp1.cpp

#include void main() { int num=0; //定义人数变量 int interval=0; //定义初始密码变量 while(num==0) { cout
www.eeworm.com/read/163381/10163169

tmp mfc469.tmp

/* Test.PL0 */ Program abc; Integer x,y,z; Real a,b; Procedure ab(Var m,n:Integer;t:Real); Begin t:=n+m; If m>n then n:=m else t:=m; While n
www.eeworm.com/read/163381/10163198

tmp mfc163.tmp

/*这是一个测试程序*/ Program abc; Integer x,y,z; Real a,b; Procedure ab(Var m,n:Integer;t:Real); Begin t:=n+m; If m>n then n:=m else t:=m; While n
www.eeworm.com/read/163381/10163200

tmp mfc46c.tmp

/*这是一个测试程序*/ Program abc; Integer x,y,z; Real a,b; Procedure ab(Var m,n:Integer;t:Real); Begin t:=n+m; If m>n then n:=m else t:=m; While n
www.eeworm.com/read/163381/10163238

pl0 test.pl0

/*这是一个测试程序*/ Program abc; Integer x,y,z; /*变量声明*/ Real a,b; Procedure ab(Var m,n:Integer; t:Real); /*过程*/ Begin t:=n+m; If m>n then /*条件语句*/ n:=m els
www.eeworm.com/read/359019/10169547

c movebytes.c

/* @(#)movebytes.c 1.12 00/05/07 Copyright 1985 J. Schilling */ /* * move data * * Copyright (c) 1985 J. Schilling */ /* * This program is free software; you can redistribute it and/or modify *
www.eeworm.com/read/358422/10189345

m fenpei.m

function [z,ans]=fenpei(marix) %////////////////////////////////////////////////// %输入效率矩阵 marix 为方阵; %若效率矩阵中有 M,则用一充分大的数代替; %输出z为最优解,ans为 最优分配矩阵; %/////////
www.eeworm.com/read/358196/10194031

c 5087测试程序.c

#include unsigned char code Tab[10]={0x47,0x1e,0x2e,0x4e,0x1d,0x2d,0x4d,0x1b,0x2b,0x4b}; unsigned char display[]={0xFC,0x60,0xDA,0xF2,0X66,0xB6,0xBE,0xE0,0xFE,0xF6,0x00}; unsigned
www.eeworm.com/read/358192/10194114

m lagrange.m

n=input('n='); %输入要做的次数 n=n+2; x=input('x[]='); %输入矩阵 y=input('y[]='); %输入矩阵 u=input('要求值:'); v=0; j=1; while j~=n l=1; i=1; while i~=n if i~=j