代码搜索：while
找到约 10,000 项符合「while」的源代码
代码结果 10,000
www.eeworm.com/read/469371/6973859
cc 2640809_tle.cc
#include
using namespace std;
int num[20];
int maxs=10000000;
void next(int a[20],int m)
{
int r=m-1;
if(a[r]-a[0]==r)
{
a[r]++;
for(int i=0;i
www.eeworm.com/read/469371/6973860
cc 2641356_tle.cc
#include
using namespace std;
int num[20];
int maxs=10000000;
void next(int a[20],int m)
{
int r=m-1;
if(a[r]-a[0]==r)
{
a[r]++;
for(int i=0;i
www.eeworm.com/read/469371/6973862
cc 2635473_tle.cc
#include
using namespace std;
int num[100];
int maxs=10000000;
void next(int a[100],int m)
{
int r=m-1;
if(a[r]-a[0]==r)
{
a[r]++;
for(int i=0;i
www.eeworm.com/read/469371/6973863
cc 2641338_tle.cc
#include
using namespace std;
int num[20];
int maxs=10000000;
void next(int a[20],int m)
{
int r=m-1;
if(a[r]-a[0]==r)
{
a[r]++;
for(int i=0;i
www.eeworm.com/read/469371/6973966
cc 2615017_wa.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/6974035
cc 2829185_ac_3359ms_464k.cc
#include
using namespace std;
int father[50002];
int n,m,a,b,c=1;
int findroot(int p)
{
while(father[p]!=p)
p=father[p];
return p;
}
int main()
{
while(t
www.eeworm.com/read/469371/6974173
c 2530261_tle.c
#include
#include
int mg[100000][7];
void com(int n)
{
int i,j,k;
for(i=0;i
www.eeworm.com/read/469371/6974178
c 2530197_ce.c
#include
#include
int mg[100000][7];
void com(int n)
{
int i,j,k;
for(i=0;i
www.eeworm.com/read/469371/6974179
c 2530205_tle.c
#include
#include
int mg[100000][7];
void com(int n)
{
int i,j,k;
for(i=0;i
www.eeworm.com/read/469371/6974189
c 2530190_wa.c
#include
#include
int mg[100000][7];
void com(int n)
{
int i,j,k;
for(i=0;i