代码搜索:while

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

代码结果 10,000
www.eeworm.com/read/486654/6524477

cpp 1565.cpp

/* This Code is Submitted by wywcgs for Problem 1565 on 2005-10-23 at 10:10:46 */ #include const int MAX = 64; int main() { int d[MAX][MAX]; long long past[MAX][MAX], r, reach;
www.eeworm.com/read/486654/6524488

cpp 1970.cpp

/* This Code is Submitted by wywcgs for Problem 1970 on 2006-01-11 at 17:45:14 */ #include #include #include using namespace std; const int MAX = 1024; bool
www.eeworm.com/read/486654/6524497

cpp 1223.cpp

/* This Code is Submitted by wywcgs for Problem 1223 on 2005-12-31 at 15:37:51 */ #include #include const int MAX = 204800; int main() { int l, t, T, i; char word[M
www.eeworm.com/read/486654/6524520

cpp 1018.cpp

/* This Code is Submitted by wywcgs for Problem 1018 on 2005-12-26 at 15:54:05 */ #include #include #include using namespace std; const int MAX = 5120; const int
www.eeworm.com/read/486654/6524561

cpp 2159.cpp

/* This Code is Submitted by wywcgs for Problem 2159 on 2006-03-08 at 16:53:35 */ #include #include #include #include using namespace std; const int MAX
www.eeworm.com/read/486654/6524574

cpp 1933.cpp

/* This Code is Submitted by wywcgs for Problem 1933 on 2006-06-16 at 19:24:38 */ #include #include using namespace std; const int CN = 8, GN = 24; int main() { int
www.eeworm.com/read/486654/6524612

cpp 1935.cpp

/* This Code is Submitted by wywcgs for Problem 1935 on 2006-08-10 at 20:19:32 */ #include #include using namespace std; int main() { int i, x[3], y[3]; while(true
www.eeworm.com/read/486654/6524635

cpp 2261.cpp

/* This Code is Submitted by wywcgs for Problem 2261 on 2006-06-03 at 17:17:36 */ #include #include #include using namespace std; const int L = 1024; int mai
www.eeworm.com/read/486654/6524660

cpp 1737.cpp

/* This Code is Submitted by wywcgs for Problem 1737 on 2006-07-24 at 17:52:09 */ #include #include using namespace std; const int N = 102400; int w, h, wn[N], hn[N];
www.eeworm.com/read/486654/6524689

cpp 1142.cpp

/* This Code is Submitted by wywcgs for Problem 1142 on 2005-10-01 at 09:58:13 */ #include int main() { int n, m, fact[13]; int l[4096], p, begin, end; int i, j, t = 1; char s