代码搜索：while
找到约 10,000 项符合「while」的源代码
代码结果 10,000
www.eeworm.com/read/144931/12761726
c main.c
// sccavr.cpp : Defines the entry point for the console application.
//
#include
#include
#include
#include
#include
#include
#inclu
www.eeworm.com/read/332356/12762602
txt t.txt
var a,b,c,d,e;
procedure p;
begin
c:=1/a
end;
procedure q;
begin
d:=1/b
end;
procedure r;
begin
e:=2/(c+d)
end;
begin
read(a);
read(b);
w
www.eeworm.com/read/332314/12763897
h eeprom169.h
/*
Workaround since the avr-libc has no support
for the ATmega169 eeprom at the time of
writing this (avr-libc V1.0)
This is based on the ATMEL Databook for the m169,
with some changes
www.eeworm.com/read/332314/12763980
c portio.c
// PortIO.c
#include
int main (void)
{
// Init port pins
DDRB = 0x00; // set port B for input
DDRD = 0xFF; // set port D for output
while(1)
{
PORTD = PINB;
}
}
www.eeworm.com/read/144891/12764239
m ex3_11.m
sum=0;
cnt=0;
val=input('Enter a number (end in 0):');
while (val~=0)
sum=sum+val;
cnt=cnt+1;
val=input('Enter a number (end in 0):');
end
if (cnt > 0)
sum
mean=sum/cn
www.eeworm.com/read/332264/12766699
java 2.34labeledwhile.java
public class LabeledWhile{
public static void main(String []args){
int i=0;
outer:
while(true){
if(i==7){ //当i==7时跳出外层循环
System.out.println("break outer");
break;
}
System.out.println("out
www.eeworm.com/read/332249/12770750
cpp 1973.cpp
//1973
#include
#include
#include
#include
#include
#include
using namespace std;
const int MAX = 10000;
bool prime[MAX];
bool vis[
www.eeworm.com/read/144774/12773552
cpp 赛德尔迭代法.cpp
#include
#include
#define n 3
void main()
{
int i,j,C=0;
double s,exp,e;
double A[n][n],B[n],X[n],Y[n];
A[0][0]=5;A[0][1]=2;A[0][2]=1;
A[1][0]=-1;A[1][1]=4;A[1][
www.eeworm.com/read/144773/12773569
cpp 雅可比迭代法.cpp
#include
#include
#define n 3
void main()
{
int i,j,C=0; //C为迭代次数，初始值为0
double s,exp,e;
double A[n][n],B[n],X[n],Y[n];
A[0][0]=5;A[0][1]=2;A[0]
www.eeworm.com/read/332139/12776284
m sel.m
%“选择”操作
function seln=sel(s,p);
inn=size(p,1);
%从种群中选择两个个体
for i=1:2
r=rand; %产生一个随机数
prand=p-r;
j=1;
while prand(j)