代码搜索：while
找到约 10,000 项符合「while」的源代码
代码结果 10,000
www.eeworm.com/read/253257/12235871
cpp 10430.cpp
#include
#include
int a[2000],la[1000],lb[1000];
int main()
{
int n,k1,k2,i,p=0;
cin>>n;
while(n--)
{
cin>>k1;
for(i=0;i>la[i];
www.eeworm.com/read/339382/12239986
cpp qcksrt.cpp
void qcksrt(int n, double arr[])
{
int m = 7; int nstack = 50; int fm = 7875; int fa = 211;
int fc = 1663; double a,fmi = 0.00012698413;
int istack[51];
int jstack = 0;
int i,j,
www.eeworm.com/read/339382/12239995
cpp sort2.cpp
void sort2(int n, double ra[], double rb[])
{
int l,ir,i,j;
double rra,rrb;
l = n / 2 + 1;
ir = n;
do
{
if (l > 1)
{
l = l - 1;
rra = ra[l];
www.eeworm.com/read/339382/12240005
cpp indexx.cpp
void indexx(int n, double arrin[], int indx[])
{
int i,j,l,ir,indxt;
double q;
for (j = 1; j
www.eeworm.com/read/339382/12240018
cpp sort.cpp
void sort(int n, double ra[])
{
int i,j,l,ir;
double rra;
l = int(n / 2) + 1;
ir = n;
do
{
if (l > 1)
{
l = l - 1;
rra = ra[l];
}
www.eeworm.com/read/339323/12243166
c hamilton.c
#include "algo.h"
#include
#define NUM 5
void hamilton(int n, int x[], int c[][NUM])
{
int i,z,k;
int cnt=0;
int* s=malloc(sizeof(int)*NUM);
for (i=0; i
www.eeworm.com/read/253077/12245481
m sor.m
function [k,w,x]=ssor(a,b,w,x0,e,N)
%用逐次超松弛法解线性方程组Ax=b;
%格式[k,w,x]=ssor(a,b,w,x0,e,N),a为系数矩阵,b为右端向量,x返回解向量,k迭代次数,w松弛因子,x0初始向量,e容取误差,N迭代次数上限,;
n=length(b);
x=x0;x0=x+2*e;
k=0;
while max(abs(x0-
www.eeworm.com/read/150914/12245760
java testeof.java
//: c12:TestEOF.java
// Testing for end of file while reading a byte at a time.
// From 'Thinking in Java, 3rd ed.' (c) Bruce Eckel 2002
// www.BruceEckel.com. See copyright notice in CopyRight.txt
www.eeworm.com/read/252984/12251577
c app.c
#include"ucos_ii.h"
int main()
{
OSInit();
// while(1);
for(;;)
OSStart();
}
www.eeworm.com/read/150794/12260700
c km6.c
//P1口接了8个发光二极管，在外部中断0上接了一个按键。
//要求开始工作时8个发光二极管全亮，当按键按下时，8
//个二极管全熄灭，并且二极管D1~~D8依次的亮（每次亮
//一个），亮到D8时又从D1开始。当再次按下键时，发光
//二极管立即按D8~~D1的顺序依次亮，亮到D1时又从D8开
//始。
#include
void initi(void)
...