代码搜索：while

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

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

c 3061553_re.c

#include char tmp[30]; struct node { int x, y, z; }itv[10000]; int n; int l, r, mid; int num(int x,int y,int z) { int k; if((y-x)%z==0) return y; else { k =
·
www.eeworm.com/read/452050/7451272

c 3061571_re.c

#include char tmp[30]; struct node { int x, y, z; }itv[10000]; int n; int l, r, mid; int num(int x,int y,int z) { int k; if((y-x)%z==0) return y; else { k =
·
www.eeworm.com/read/452050/7451311

c 1832658_wa.c

# include void main() { long i, j, n, sum; while(1) { scanf("%ld",&n); if(!n) break; sum = 0; while(1) { while(n) { sum += n % 10; n /= 10; }
·
www.eeworm.com/read/452050/7451327

c 2142705_ac_15ms_72k.c

# include int N2[] = {6,2,4,8}; int N5[] = {1,5}; int N9[] = {1,9}; int N[] = {1,1,1,3,9}; int ans; int f2(int n) { int tn, t; if(n
·
www.eeworm.com/read/452050/7451328

c 2142659_ac_0ms_72k.c

# include int l[10001]; int N2[] = {6,2,4,8}; int N5[] = {1,5}; int N9[] = {1,9}; int N[] = {1,1,1,3,9}; int ans; int f2(int n) { int tn, t; if(n
·
www.eeworm.com/read/452050/7451358

c 2381880_wa.c

#include #include int l, n, i, L[10000], t, mark[10000], ans; char pos[10000][5], p; void input() { scanf("%d%d",&l,&n); p = 'l';ans = 0; memset(mark,0,sizeof(mark));
·
www.eeworm.com/read/452050/7451359

c 2381744_wa.c

#include int l, n, i, L[10000], t, ans; char pos[10000][5], p; void input() { scanf("%d%d",&l,&n); p = 'l';ans = 0; for(i = 0; i < n; i++) scanf("%d%s",&L[i],&pos[i]); for(i =
·
www.eeworm.com/read/452050/7451360

c 2382009_ac_15ms_52k.c

#include int len, n, i, L, R, l, r, t, ans, mark; int left[10000], right[10000], p; char pos[5]; void input() { scanf("%d%d",&len,&n); p = 0;ans = 0;L = l = r = R = 0; for(i = 0
·
www.eeworm.com/read/452050/7451361

c 2381738_re.c

#include void input() { int l, n, i, L[1000], t, ans; char pos[1000][5], p; scanf("%d%d",&l,&n); p = 'l';ans = 0; for(i = 0; i < n; i++) scanf("%d%s",&L[i],&pos[i]); for
·
www.eeworm.com/read/452050/7451366

cc 3032698_ac_171ms_1200k.cc

#include int sum[50001], w[50001], h[50001]; int inv[50001]; int left[50001], right[50001]; int main() { int n, i, j; int Sum, ans; while(scanf("%d",&n)==1,n!=-1) { for
·