代码搜索:while

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

代码结果 10,000
www.eeworm.com/read/469371/6973884

cpp 2539961_tle.cpp

#include using namespace std; struct { int rank; int father; int son; }node[30001]; void init() { for(int i=1;i
www.eeworm.com/read/469371/6973889

cpp 2540428_tle.cpp

#include using namespace std; struct { int sum; int counts; int com[200]; //以空间换时间 int father; int lev; }node[30001]; void init() { for(i
www.eeworm.com/read/469371/6973894

cpp 2540410_tle.cpp

#include using namespace std; struct { int sum; int counts; int com[100]; //以空间换时间 int father; int lev; }node[30001]; void init() { for(i
www.eeworm.com/read/469371/6973925

cc 2279440_tle.cc

#include using namespace std; int countnum(int n) { if(n==2) return 1; else { int m=0; int k=n-2; for(int i=4;i
www.eeworm.com/read/469371/6973953

cc 2264414_wa.cc

#include #include using namespace std; int addlist(double p[1000][4],int length,int r) { double min=0; for(int i=0;i>p[i][0];
www.eeworm.com/read/469371/6973954

cc 2273159_ac_140ms_224k.cc

#include #include using namespace std; void partion(double c[1000][2],int left,int right) { int i=left,j=right; if(left
www.eeworm.com/read/469371/6973955

cc 2269738_ac_390ms_252k.cc

#include #include using namespace std; int addlist(double p[1000][4],int length,int r) { double min=0; for(int i=0;i
www.eeworm.com/read/469371/6973956

cc 2269749_ac_389ms_252k.cc

#include #include using namespace std; int addlist(double p[1000][4],int length,int r) { int tmp; int tmpb; for(int i=0;i
www.eeworm.com/read/469371/6973957

cc 2265589_wa.cc

#include #include using namespace std; int addlist(double p[1000][4],int length,int r) { double min=0; for(int i=0;i>p[i][0];
www.eeworm.com/read/469371/6973959

cc 2269748_ce.cc

#include #include using namespace std; int addlist(double p[1000][4],int length,int r) { int tmp; int tmpb; for(int i=0;i