代码搜索：while

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

代码结果 10,000
热门代码： main.c GPIO I2C SPI UART timer interrupt ADC PWM LED
www.eeworm.com/read/448968/7521439

cpp ariprog.cpp

/* ID: chenkai4 PROG: ariprog LANG: C++ */ #include #include using namespace std; ifstream in("ariprog.in"); ofstream out("ariprog.out"); #define MAXARRAY 10001 int N,M
·
www.eeworm.com/read/448932/7521717

cpp 3139784_re.cpp

#include int ok(int input[],int t,int result); int pick(int input[],int t,int re); int geshu=0; void dubble(int a[],int t) {int i,temp ,work; for(int pass=1;pass
·
www.eeworm.com/read/448932/7521751

cpp 4692144_ac_282ms_660k.cpp

#include #include using namespace std; typedef int Graph[200][200]; typedef int Path[200]; Graph map,flow; int n,s,t; int EK() { int i, j, k=0, c, head, tail; Gra
·
www.eeworm.com/read/448932/7521752

cpp 4692082_ce.cpp

#include #define MAX 1000000 using namespace std; int n,np,nc,nb,m; char input; int map[105][105];//0为超级s，n+1为超级T int cf[105][105]; int prev[105],dis[105]; bool used[105]; int all;
·
www.eeworm.com/read/448932/7521753

cpp 4692141_tle.cpp

#include #define MAX 1000000 using namespace std; int n,np,nc,nb,m; char input; int map[105][105];//0为超级s，n+1为超级T int cf[105][105]; int prev[105],dis[105]; bool used[105]; int all;
·
www.eeworm.com/read/448932/7521754

cpp 4692117_tle.cpp

#include #define MAX 1000000 using namespace std; int n,np,nc,nb,m; char input; int map[105][105];//0为超级s，n+1为超级T int cf[105][105]; int prev[105],dis[105]; bool used[105]; int all;
·
www.eeworm.com/read/448932/7521755

cpp 4692001_tle.cpp

#include #define MAX 1000000 using namespace std; int n,np,nc,nb,m; char input; int map[105][105];//0为超级s，n+1为超级T int cf[105][105]; int prev[105],dis[105]; bool used[105]; int all;
·
www.eeworm.com/read/448932/7521889

cc 4642863_ac_110ms_8628k.cc

#include using namespace std; __int64 p[2700000]; int f1,f2,b,temp; int x; void BFS() { p[0]=1; f1=0; while(1) { if(p[f1]%x==0) { printf("%I64d\n",p[f1]); return
·
www.eeworm.com/read/448932/7521904

cpp 3144119_wa.cpp

#include int x[21][21][21]; int w(int a,int b,int c) {if(a20) return x[20][20][20]; if(x[a][b][c]!=0) return x[a][b][c]; if(a
·
www.eeworm.com/read/448932/7521909

cpp 3141197_tle.cpp

#include int w(int a,int b,int c); int main() {int a,b,c; while(!(a==-1&&b==-1&&c==-1)) {cin>>a>>b>>c; cout
·