代码搜索：while
找到约 10,000 项符合「while」的源代码
代码结果 10,000
www.eeworm.com/read/434436/7866432
m one2.m
clear
clc %清屏
data=xlsread('data1_2.xls');%读取xls中数据，相当与data=[5 12 21 23 43 54 34 31 33 56 57 78]
b0=data(2);
len=length(data);
N=(length(data)-2)/2;
fprintf('输入数据:\n');
fpr
www.eeworm.com/read/299227/7874145
cpp graph3.cpp
//图的运算的实现文件graph3.cpp
#include"graph3.h"
//构造函数,初始化图的邻接矩阵与边集数组
adjMList::adjMList(RCW GE[],int n,int e)
{int i,j;
for(i=0; i
www.eeworm.com/read/399279/7875650
f90 e_322_01.f90
read *, n
j=int(sqrt(n*1.)); i=2
do while ((mod(n,i)/=0) .and. (i
www.eeworm.com/read/399279/7875869
f90 e_322_03.f90
!碾转相除法：如27和6，先用27除以6，余数为3。再用6除以3，余数为零，即3为最大公约数。
read *, m,n
if(m.lt.n) then
k=m; m=n; n=k
end if
k=mod(m,n)
do while (k/=0)
m=n; n=k; k=mod(m,n)
end do
print *, '最大公约数＝',n
end
www.eeworm.com/read/434241/7879643
c usart.c
//USART.C IS THE USART ROUTINE FILE FOR MICROCHIP C18 COMPILER
// FUNCTIONS EXPLANATION
//
//USART_INIT:
// THIS FUNCTION IS USED TO CONFIGURE THE USART MODULE FOR
// USART COMMUNICATION
//
www.eeworm.com/read/399194/7881452
c 计算器.c
#include
#define uchar unsigned char
#define uint unsigned int
char a[16]={0};
char b[16]={0};
uchar dm[]={0x3f,0x06,0x5b,0x4f,0x66,0x6d,0x7d,0x07,0x7f,0x6f,0x79,0x40};
uchar wx[
www.eeworm.com/read/399194/7881470
bak 计算器.bak
#include
#define uchar unsigned char
#define uint unsigned int
char a[16]={0};
char b[16]={0};
uchar dm[]={0x3f,0x06,0x5b,0x4f,0x66,0x6d,0x7d,0x07,0x7f,0x6f,0x79,0x40};
uchar wx[
www.eeworm.com/read/199077/7889871
cpp hour06_2.cpp
//Listing 6.13 //Illustrates nested for loops #include int main() { int rows, columns;
int i; char theChar; std::cout > rows; std
www.eeworm.com/read/398967/7904906
c jmbadgeboard.c
/*!
* \file jmbadgeboard.c
* \brief Main source for JM Badge Board
* \version $Revision: 1.6 $
* \author Anthony Huereca and Michael Norman
*/
#include "jmbadgeboard.h"
#include "m
www.eeworm.com/read/398873/7913346
pl0 test.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 else t:=m;
While n