代码搜索:while

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

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

cc 1844481_ce.cc

# include void main() { long m, n, t, r, NO; while(scanf("%ld%ld",&m,&n)==2) { NO = 0; while(m) { t = m/n; r = m%n; NO += m - r; if(!t) {NO+=
www.eeworm.com/read/452050/7449293

c 1852172_tle.c

# include # include void main() { int m, i, j, yes, mark, a[12][2]; char str[20]; while(1) { scanf("%d",&m); getchar(); if(!m) break;
www.eeworm.com/read/452050/7449294

c 1852162_tle.c

# include # include void main() { int m, i, j, yes, mark, a[12][2]; char str[20]; while(1) { scanf("%d",&m); getchar(); if(!m) break;
www.eeworm.com/read/452050/7449338

cpp 2503823_ac_0ms_140k.cpp

#include #include #include #include char w[13], x[13]; int num; int f(int p) { int i, j, no, t; for(i = p; x[i]!='\0'; i++) { if(x[i]!='?'
www.eeworm.com/read/452050/7449352

cpp 3957285_wa.cpp

#include #include #include using namespace std; typedef pair T; vector v[4], q[4]; bool cmp(T a, T b) { return a.first < b.first; } int m
www.eeworm.com/read/452050/7449427

cpp 1842953_ac_0ms_8k.cpp

# include void main() { int x, n, y; scanf("%d",&n); while(n--) { scanf("%d%d",&x,&y); if(x == y||x == y + 2) { if(x%2) printf("%d\n",y+x-1); els
www.eeworm.com/read/452050/7449432

cc 3120956_ac_359ms_4104k.cc

#include #include int array[1001][1001], len[1001], left[1001], right[1001]; int main() { int i, j, m, n, k; int tmp, ans, cas; char str[2]; scanf("%d",&cas);
www.eeworm.com/read/452050/7449462

c 1833352_ac_0ms_24k.c

# include int apple(int m, int n) { if(m < 0) return 0; if(m == 0) return 1; if(n == 0) return 0; return apple(m - n, n) + apple(m, n - 1); } void main() { int m, n,
www.eeworm.com/read/452050/7449463

c 1833342_ce.c

# include int apple(int m, int n) { if(m < 0) return 0; if(m == 0) return 1; if(n == 0) return 1; return apple(m - n, n) + a(m, n - 1); } void main() { int m, n, s;
www.eeworm.com/read/452050/7449470

cpp 4022570_re.cpp

#include #include #include using namespace std; int n, m; int label[300]; int cnt; int map[300][300]; int error; int visited[300]; int d[300]; int hea