代码搜索:while

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

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

c 3032681_ac_78ms_1128k.c

#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
www.eeworm.com/read/452050/7451387

cc 3084687_ac_1906ms_15920k.cc

#include #include int array[2001][2001], len[2001], left[2001], right[2001]; int main() { int i, j, m, n, k; int tmp, ans; while(scanf("%d%d",&n,&m)==2) { for
www.eeworm.com/read/452050/7451420

cc 3529508_ac_32ms_316k.cc

#include int main() {int i,j,k,max,count,n,c[1000]; char a[10002],b[10002]; scanf("%d",&n); getchar(); for(i=0;i
www.eeworm.com/read/452050/7451421

cc 3529373_wa.cc

#include #include #include int N, tmp; struct node { char str[10001]; }id[2]; int pai[10001]; int changdu[2]; void pre(char p[]) { int k, q; pai
www.eeworm.com/read/452050/7451422

cc 3529363_wa.cc

#include #include #include int N, tmp; struct node { char str[10001]; }id[2]; int pai[210]; int changdu[4010]; void pre(char p[]) { int k, q; pa
www.eeworm.com/read/452050/7451498

c 2557790_ac_0ms_80k.c

#include #include #include char a[9], b[9], c[9], tmp[9]; int main() { int n, x, y, z, m; scanf("%d", &n); while (n--) { scanf("%s %s %s", a, b, c); m = 1
www.eeworm.com/read/452050/7451532

c 2495466_wa.c

#include #include int h, w; int num, step, cas = 1; int map[21][21], col[21], row[21]; int up, down, left, right; int main() { int i, j, max; int x, y; char dir[6
www.eeworm.com/read/452050/7451533

c 2495479_ac_0ms_192k.c

#include #include int h, w; int num, step, cas = 1; int map[21][21], col[21], row[21]; int up, down, left, right; int main() { int i, j, max; int x, y; char dir[6
www.eeworm.com/read/452050/7451545

cc 3129799_ce.cc

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

cpp 3129797_ac_297ms_196k.cpp

#include #include double INF = 210000000000; using namespace std; double x[701], y[701]; int main() { int i, j, n, l, max, ans; double K[701]; while(scanf("