代码搜索：while

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

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

java 3090873_ac_5780ms_5340k.java

import java.util.*; public class Main { public static void main(String[] args) { Scanner cin = new Scanner(System.in); int i, j, k, n; int [] len = new int [50
·
www.eeworm.com/read/452050/7451035

c 3080626_ac_7421ms_508k.c

#include #include #define MaxV 210 int n, M; int ans, sum; struct node { int map[MaxV][MaxV]; }t2, t1; double pos[110][2]; double D; int reachable(int i, int j)
·
www.eeworm.com/read/452050/7451113

c 3157485_ac_110ms_15072k.c

#include #include int comp[1300000]; int cnt; int prime[1300000], ans[1300000]; void init() { int i, j, tmp; memset(prime,0,sizeof(prime)); for(i = 3; i
·
www.eeworm.com/read/452050/7451205

cpp 2987135_wa.cpp

#include #include #include #include int main() { int min; int i, j, n, num, last; int l, r; char str[500]; while(gets(str)!=NULL) { nu
·
www.eeworm.com/read/452050/7451206

cpp 2987131_ole.cpp

#include #include #include #include int main() { int min; int i, j, n, num, last; int l, r; char str[500]; while(gets(str)!=NULL) { nu
·
www.eeworm.com/read/452050/7451207

cpp 2987150_wa.cpp

#include #include #include #include int main() { int min; int i, j, n, num, last; int l, r; char str[500]; while(gets(str)!=NULL) { nu
·
www.eeworm.com/read/452050/7451209

cpp 2508153_ac_498ms_180k.cpp

#include "stdio.h" int main() { int n, i, a[8100], l[8100], e, k; scanf("%d",&n); for (i=1;i
·
www.eeworm.com/read/452050/7451225

cpp 2995395_ac_15ms_84k.cpp

#include #include #include using namespace std; int R, n; int pos[1001], mark[1001]; int main() { int i, j, k, tmp, ans, no; while(1) { scanf("
·
www.eeworm.com/read/452050/7451249

c 1860168_ac_0ms_24k.c

# include void main() { int a[2][101]; int N, D; int i, j; while(scanf("%d%d",&N,&D)==2&&N&&D) { for(i = 0; i < N; i++) scanf("%d",&a[0][i]); for(i = 0; i
·
www.eeworm.com/read/452050/7451268

c 3061574_wa.c

#include char tmp[100]; struct node { int x, y, z; }itv[1000000]; int n; int l, r, mid; int num(int x,int y,int z) { int k; if((y-x)%z==0) return y; else {
·