代码搜索：while

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

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

c 2390679_ac_0ms_12k.c

#include #include char a[11][81], b[11][81]; char text[300]; int main() { int i, r, l; char *p, tmp[300]; while(scanf("%d",&r),r) { getchar(); for(i = 0; i <
·
www.eeworm.com/read/452050/7450872

c 2390675_re.c

#include #include char a[11][81], b[11][81]; char text[300]; void main() { int i, r, l; char *p, tmp[81]; while(scanf("%d",&r),r) { getchar(); for(i = 0; i <
·
www.eeworm.com/read/452050/7450873

cc 3568916_ac_0ms_448k.cc

#include #include #define inf 100000000 using namespace std; int n; char chess[5][5]; int map[50][50]; int LINK[50], b[50]; int l, r; int idl[5][5], idr[5][5]; v
·
www.eeworm.com/read/452050/7450900

cpp 1937231_wa.cpp

#include #include void main() { int n,i; unsigned long p[11],j; cin>>n; while(n>=1&&np[i]; for(i=1;i
·
www.eeworm.com/read/452050/7450931

cpp 2183882_re.cpp

# include # include using namespace std; void input() { int i, j, n, ans, tmp; int a[4001], b[4001], c[4001], d[4001]; int A[40*40+1], B[40*40+1]; scanf("%d",&n)
·
www.eeworm.com/read/452050/7450932

cc 2183910_ac_3420ms_49048k.cc

#include #include using namespace std; int N; int A[4000],B[4000],C[4000],D[4000]; int AB[4000*4000],CD[4000*4000]; int main(){ int i,j,p,cnt=0; while(scanf("%
·
www.eeworm.com/read/452050/7450933

cc 2183920_ac_3561ms_49048k.cc

# include # include using namespace std; long i, j, n; long ans, tmp; long a[4001], b[4001], c[4001], d[4001]; long A[4000*4001], B[4000*4001]; void input() { s
·
www.eeworm.com/read/452050/7450934

cc 2183906_re.cc

# include # include using namespace std; void input() { long i, j, n; long ans, tmp; long a[4001], b[4001], c[4001], d[4001]; long A[4000*4001], B[4000*4001];
·
www.eeworm.com/read/452050/7450943

cpp 2366173_wa.cpp

#include #include int ans; int n, F, D, m; int map[310][310]; int bfs() { int i, mark = 0; int f, r, p; int pre[310], visited[310]; int queue[310]; int C, F[31
·
www.eeworm.com/read/452050/7450944

cpp 2366176_wa.cpp

#include #include int ans; int n, F, D, m; int map[310][310]; int bfs() { int i, mark = 0; int f, r, p; int pre[310], visited[310]; int queue[310]; int C, F[31
·