代码搜索:while

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

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

cc 2264224_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/6973961

cc 2264243_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/6973969

cc 2614960_tle.cc

#include using namespace std; int mg[11]; int q(int m,int n) { if(m==1 || n==1) return 1; int count=1,k,h=0; mg[0]=m; while(mg[0]>=mg[1]) { k=n-1
www.eeworm.com/read/469371/6973970

cc 2614945_tle.cc

#include using namespace std; int mg[11]; int q(int m,int n) { int count=1,k,h=0; mg[0]=m; while(mg[0]>=mg[1]) { k=n-1; while(m
www.eeworm.com/read/469371/6973985

cc 2760398_tle.cc

#include using namespace std; int num[100]; int k=0,sum=0; void fenjie(int n) { int i=2,sign=0; while(i
www.eeworm.com/read/469371/6973986

cc 2760368_tle.cc

#include using namespace std; int num[100]; int k=0,sum=0; void fenjie(int n) { int i=2,sign=0; while(i
www.eeworm.com/read/469371/6973987

cc 2760396_tle.cc

#include using namespace std; int num[100]; int k=0,sum=0; void fenjie(int n) { int i=2,sign=0; while(i
www.eeworm.com/read/469371/6973992

cc 2848058_re.cc

#include using namespace std; typedef struct { int u; int v; int w; }node; int n,c=1; node num[10000]; void qsort(int k) { int i; for(int j=1;j
www.eeworm.com/read/469371/6973995

cc 2848066_wa.cc

#include using namespace std; typedef struct { int u; int v; int w; }node; int n,c=1; node num[1000000]; void qsort(int k) { int i; for(int j=1;j
www.eeworm.com/read/469371/6974001

cc 2848098_ac_15ms_288k.cc

#include using namespace std; typedef struct { int u; int v; int w; }node; int n,c=1; node num[10000]; void qsort(int k) { int i; for(int j=1;j