代码搜索:while

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

代码结果 10,000
www.eeworm.com/read/452050/7449852

c 1842692_pe.c

# include void main() { int i, j, max, a[27]; char ch, tmp[28]; for(i = 0; i < 27; i++) a[i] = 0; max = -1; while(scanf("%c",&ch)==1) if(ch='A') a[ch-'A
www.eeworm.com/read/452050/7449853

c 1842733_ac_0ms_24k.c

# include void main() { int i, j, max, a[27]; char ch, tmp[28]; for(i = 0; i < 27; i++) a[i] = 0; max = -1; while(scanf("%c",&ch)==1) if(ch='A') a[ch-'A
www.eeworm.com/read/452050/7449854

c 1842681_pe.c

# include void main() { int i, j, max, a[27]; char ch, tmp[28]; for(i = 0; i < 27; i++) a[i] = 0; max = -1; while(scanf("%c",&ch)==1) if(ch='A') a[ch-'A
www.eeworm.com/read/452050/7450214

c 1828693_ac_15ms_36k.c

# include # include # include main() { int i,j,k,n,m,mm,len,mark,flag,sig,point,radio; char tmp,num[20],output[10000],temp[10000]; while(scanf("%s%d",&num,&n
www.eeworm.com/read/452050/7450215

cpp 1785378_ac_15ms_56k.cpp

# include # include # include main() { int i,j,k,n,m,mm,len,mark,flag,sig,point,radio; char tmp,num[20],output[10000],temp[10000]; while(scanf("%s%d",&nu
www.eeworm.com/read/452050/7450341

c 1848427_ac_0ms_36k.c

# include void main() { int C, m, n, NO, a[1001]; long sum; scanf("%d",&C); while(C--) { scanf("%d",&m); sum = NO = 0; for(n = 0; n < m; n++) {
www.eeworm.com/read/452050/7450342

c 1848426_re.c

# include void main() { int C, m, n, NO, a[101]; long sum; scanf("%d",&C); while(C--) { scanf("%d",&m); sum = NO = 0; for(n = 0; n < m; n++) {
www.eeworm.com/read/452050/7450345

cpp 2879205_tle.cpp

#include #include #include int n, nnn; int m, k; struct node { int mat[11][11]; }; node tmp, tt; int no, num[1000], c[1000]; __int64 ans, e; int fai(int
www.eeworm.com/read/452050/7450346

cpp 2879182_re.cpp

#include #include #include int n; int m, k; struct node { int mat[11][11]; }; node tmp, tt; int no, num[100], c[100]; __int64 ans, e; int fai(int mm) {
www.eeworm.com/read/452050/7450347

cpp 2879195_re.cpp

#include #include #include int n; int m, k; struct node { int mat[11][11]; }; node tmp, tt; int no, num[1000], c[1000]; __int64 ans, e, nn; int fai(int m