代码搜索：while
找到约 10,000 项符合「while」的源代码
代码结果 10,000
www.eeworm.com/read/389435/8521237
java example5_10.java
import java.applet.*;
import java.awt.*;
public class Example5_10 extends Applet
{
public double eeaitken(double x0,double h,int n,double[] y,double t,double eps)
{int i,j,k,l;
double[] p=ne
www.eeworm.com/read/389435/8521303
java example4_6.java
import java.applet.*;
import java.awt.*;
public class Example4_6 extends Applet
{
public static void F(int n,double[] a,double x,double y,double[] s)
{int i;double temp;
s[0]=a[0];s[1]=0;
www.eeworm.com/read/188596/8525579
cpp 1088.cpp
#include
int main()
{
int n,m,i,k,j,p;
int a[151];
int flag;
while(1)
{
scanf("%d",&n);
if(n==0) return 1;
for(m=2;;m++) /*m为搜索的值；*/
{
flag=0;
for(p=0;p
www.eeworm.com/read/188596/8525581
bak 1088.cpp.bak
#include
int main()
{
int n,m,i,k,j,p;
int a[151];
int flag;
while(1)
{
scanf("%d",&n);
if(n==0) return 1;
for(i=0;i
www.eeworm.com/read/188596/8525605
c 1178.c
#include
int a[10000]={0};
int b[10000]={0};
int q,l,r,j,i,x,n;
void p(int l,int r)
{
j=r;i=l;x=a[i];
while (i!=j)
{
while (a[j]>x&&j>i) j--;
if (i
www.eeworm.com/read/188596/8525607
c 1055.c
#include
#include
void main()
{
int d[50001]={0},n,m,i,j,k;
scanf("%d %d",&n,&m);
for(i=m+1;i
www.eeworm.com/read/188596/8525651
pas 1178.pas
var a:array[1..10000]of longint;
b:array[1..10000]of integer;
q,l,r,j,i,x,n:longint;
procedure Qsort(l,r:integer);
begin
if l>=r then exit;
j:=r;i:=l;x:=a[i];
while not(i
www.eeworm.com/read/188596/8525674
cpp 1014.cpp
#include
int main()
{
long N;
int i,ok,m;
int a[2000]={0};
cin>>N;
ok=1;
m=1;
if(N==0)
{
ok=0; m=0;
}
while(ok)
{
for(i=9;i>=1;i--)
{
if(i==1)
www.eeworm.com/read/188596/8525690
cpp 1022.cpp
#include
#include
void main(){
int n,a[101][101]={0},i,j,k[101]={0},l;
scanf("%d",&n);
for(i=1;i
www.eeworm.com/read/188596/8525806
c 1014.c
#include
main()
{
int a[10]={0},n,i,k;
scanf("%d",&n);
a[0]=10; a[1]=1;
if(n==0||n==1)
printf("%d",a[n]);
else
{
for(i=9;i>=2;i--)
while(n%i==0)
{
n=n/i;