代码搜索:while

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

代码结果 10,000
www.eeworm.com/read/348818/10865936

c 2410lib.c

//=================================================================== // File Name : 2410lib.c // Function : S3C2410 PLL,Uart, LED, Port Init // Program : Shin, On Pil (SOP) // Date : Marc
www.eeworm.com/read/419410/10870578

c 3-3.c

#include main() { int sum=0, i=1; do { sum=sum+i; i=i+1; }while(i
www.eeworm.com/read/274416/10872901

c vecops.c

/*---------------------------------------------------------------------- File : vecops.c Contents: some special vector operations Author : Christian Borgelt History : 16.09.1996 file creat
www.eeworm.com/read/274366/10874126

cpp shunxu.cpp

#include #define N 10 typedef int keytype ; typedef int elemtype ; typedef struct { keytype key; /* 关键字类型 */ elemtype
www.eeworm.com/read/274306/10877628

cpp nbtheory.cpp

// nbtheory.cpp - written and placed in the public domain by Wei Dai #include "pch.h" #include "nbtheory.h" #include "modarith.h" #include #include NAMESPACE_BEGIN(Crypto
www.eeworm.com/read/348596/10881773

txt 2935.txt

Problem Id:2935 User Id:fzk Memory:72K Time:15MS Language:C++ Result:Accepted Source #include #include #include #include #include #inclu
www.eeworm.com/read/348596/10881785

txt 1810.txt

Problem Id:1810 User Id:fzk Memory:80K Time:765MS Language:C++ Result:Accepted Source #include"iostream.h" #include"algorithm" using std::sort; int s[1001],N,K,M; long d[10000];
www.eeworm.com/read/348596/10881811

txt 1318.txt

#include"iostream.h" inline int same(char *p1,char *p2) {int n,i=0,j=0,*t1,*t2; while(p1[i]!=0)i++; while(p2[j]!=0)j++; n=j; if(i!=j)return 0; t1=new int[256]; t2=new int[256]; for(i=
www.eeworm.com/read/348596/10881863

txt 1654.txt

#include const int dx[]={-1, 0, 1,-1, 0, 1,-1, 0, 1}; const int dy[]={-1,-1,-1, 0, 0, 0, 1, 1, 1}; int main() { int x1, x2, y1, y2, cas; char c; __int64 area; scanf( "%d"
www.eeworm.com/read/348596/10881955

txt 1519.txt

#include"iostream.h" char w[1000]; long a,s; int main() {int i; while(1) {cin>>w; if(cin.fail()||(w[0]=='0'&&w[1]==0))break; for(s=0,i=0;w[i];i++)s+=w[i]-'0'; while(s>=10) {for(a