代码搜索:while

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

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

c 3334192_ac_0ms_208k.c

#include #include int main() { int d, s, min, m, t, x, a; while(scanf("%d%d",&t,&x)==2) { scanf("%d",&m); if(m==0) { printf("%d\n",t*x); } else
www.eeworm.com/read/452050/7448970

c 2250736_ac_0ms_-12k.c

# include int pos[9][2]; int pz[3][3]; char tmp[10][2]; void up() { printf("u"); pos[0][0]--; pz[pos[0][0]+1][pos[0][1]] = pz[pos[0][0]][pos[0][1]]; pz[pos[0][0]][pos[0][1]]
www.eeworm.com/read/452050/7448971

cc 2250729_ac_0ms_44k.cc

# include int pos[9][2]; int pz[3][3]; char tmp[10][2]; void up() { printf("u"); pos[0][0]--; pz[pos[0][0]+1][pos[0][1]] = pz[pos[0][0]][pos[0][1]]; pz[pos[0][0]][pos[0][1]]
www.eeworm.com/read/452050/7448972

c 2250730_ac_0ms_-12k.c

# include int pos[9][2]; int pz[3][3]; char tmp[10][2]; void up() { printf("u"); pos[0][0]--; pz[pos[0][0]+1][pos[0][1]] = pz[pos[0][0]][pos[0][1]]; pz[pos[0][0]][pos[0][1]]
www.eeworm.com/read/452050/7449000

c 1837183_ac_0ms_40k.c

# include # include void main() { int m, n, i, j; long sal[1001], total; char word[50], dic[1001][17]; scanf("%d%d",&m,&n); for(i = 0; i < m; i++) scanf
www.eeworm.com/read/452050/7449013

c 2093174_wa.c

# include int N, M; char g[301][301]; void input() { int i, j, s; while(scanf("%d%d",&N,&M)==2&&N&&M) { s = 0; for(i = 0; i < N; i++) scanf("%s",g
www.eeworm.com/read/452050/7449018

cpp 2646183_ac_31ms_872k.cpp

#include #include #include #define INIT (tree *)malloc(sizeof(tree)) using namespace std; int n; typedef struct node { int len, ape; char word[101];
www.eeworm.com/read/452050/7449019

cpp 2646182_tle.cpp

#include #include #include #define INIT (tree *)malloc(sizeof(tree)) using namespace std; int n; typedef struct node { int len, ape; char word[101];
www.eeworm.com/read/452050/7449020

c 2903940_ce.c

#include #include using namespace std; bool cmp(int a,int b) { return a > b; } int main() { int p, q, r, s; int i, m, n; int n1, n2; int up[20001], down[20
www.eeworm.com/read/452050/7449021

cpp 2903942_ac_31ms_288k.cpp

#include #include using namespace std; bool cmp(int a,int b) { return a > b; } int main() { int p, q, r, s; int i, m, n; int n1, n2; int up[20001], down[20