代码搜索：while

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

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

cc 2256592_ac_2389ms_8448k.cc

# include int m, n; long p, pz[1001][1001]; long a[1000001], b[1000001]; int pi, pj; long res; void merge(long begin,long mid,long end) { long i, j, k = 0; for(i = begin, j
·
www.eeworm.com/read/452050/7449595

c 2949785_wa.c

# include int s[6001]; int a, b, c, d; int min(int p,int q) { return p < q ? p : q; } void init() { int i, n; int t1, t2, t3, t4, ta, tb, tc, td; a = 2;b = 3;c = 5;d =
·
www.eeworm.com/read/452050/7449614

cpp 2745981_ac_109ms_72k.cpp

#include int main() { int n, i, num; while (scanf("%d",&n)==1) { if(n%4!=0&&n%4!=1) { printf("0\n"); continue; } if(n==1) { printf("1\n"); continue
·
www.eeworm.com/read/452050/7449636

cpp 2279045_re.cpp

# include using namespace std; int si, sj, ei, ej, l; void bfs() { int queue[100001][3]; int i, j, w = 0; long f, r; int mark[101][101]; f = r = -1; memset(mark,0,si
·
www.eeworm.com/read/452050/7449637

cpp 2279040_re.cpp

# include using namespace std; int si, sj, ei, ej, l; void bfs() { int queue[10001][3]; int i, j, w = 0; int f, r; int mark[101][101]; f = r = -1; memset(mark,0,size
·
www.eeworm.com/read/452050/7449638

cpp 2279046_ac_156ms_1672k.cpp

# include using namespace std; int si, sj, ei, ej, l; void bfs() { int queue[100001][3]; int i, j, w = 0; long f, r; int mark[301][301]; f = r = -1; memset(mark,0,si
·
www.eeworm.com/read/452050/7449691

cpp 3129805_ac_1157ms_204k.cpp

#include #include double INF = 210000000000; using namespace std; double x[1001], y[1001]; int main() { int i, j, n, l, max, ans; double K[1001]; while(scan
·
www.eeworm.com/read/452050/7449699

c 1833453_ac_0ms_24k.c

# include void main() { int A, B, C, D, T; long E, F; while(scanf("%d%d%d%d",&A,&B,&C,&D) == 4&&A&&B&&C&&D) { if(A > B) {T = A; A = B; B = T;} if(C > D) {T = C; C = D; D
·
www.eeworm.com/read/452050/7449707

c 1970524_tle.c

# include static long b[] = {16,220,2800,34000,310000,400000,4600000,49000000}; static long a[] = {1,10,100,1000,10000,100000,1000000,10000000}; int main() { int T, n, m; long i, j
·
www.eeworm.com/read/452050/7449742

c 1832181_ac_0ms_24k.c

# include void main() { int n; long r, e, c; scanf("%d",&n); while(n--) { scanf("%ld%ld%ld",&r,&e,&c); if(e == r + c) printf("does not matter\n"); else if(e > r + c) pri
·