代码搜索：while
找到约 10,000 项符合「while」的源代码
代码结果 10,000
www.eeworm.com/read/452050/7451319
cpp 2485668_ac_77ms_512k.cpp
#include
#include
using namespace std;
int a[100001];
int n, c;
int main()
{
int i, j, no;
int min, max, mid;
scanf("%d%d",&n,&c);
for(i = 0; i < n; i++)
s
www.eeworm.com/read/452050/7451392
cc 3157865_ac_1219ms_388k.cc
#include
int next[10001];
int prev[10001];
int main()
{
int n, m, t, k;
int i, num, now;
while(scanf("%d%d%d",&n,&k,&m)==3){
if(n==0&&k==0&&m==0)
break;
for(i = 1; i
www.eeworm.com/read/452050/7451425
c 1862038_tle.c
# include
void main()
{
long i, j, T;
long N, S;
int a[100001];
long sum, tmp, min;
scanf("%ld",&T);
while(T--)
{
scanf("%ld%ld",&N,&S);
min = 100000;
for(i = 0
www.eeworm.com/read/452050/7451504
cc 3160675_tle.cc
#include
#include
#include
int from[257][100000];
char dp[257][100000];
int add[257][100000];
int num;
int getnum(char str[],int st,int ed)
{
char ch;
i
www.eeworm.com/read/452050/7451507
cc 3160671_ole.cc
#include
#include
#include
int from[257][100000];
char dp[257][100000];
int add[257][100000];
int num;
int getnum(char str[],int st,int ed)
{
char ch;
i
www.eeworm.com/read/452050/7451508
cc 3160665_ole.cc
#include
#include
#include
int from[257][100000];
char dp[257][100000];
int add[257][100000];
int num;
int getnum(char str[],int st,int ed)
{
char ch;
i
www.eeworm.com/read/452050/7451509
cc 3160669_ole.cc
#include
#include
#include
int from[257][100000];
char dp[257][100000];
int add[257][100000];
int num;
int getnum(char str[],int st,int ed)
{
char ch;
i
www.eeworm.com/read/452050/7451528
cc 3473242_ac_610ms_5556k.cc
#include
#include
#include
#include
#define WHITE 0
#define BLACK 1
using namespace std;
int n, m;
vector tree[901], s[901];
int color[901],
www.eeworm.com/read/452050/7451686
cpp 3956776_ac_0ms_220k.cpp
#include
#include
#include
struct node
{
double pos;
int y, g, r;
int tot;
}l[10];
int main()
{
int n, i, j;
int m[100];
double v;
double t;
in
www.eeworm.com/read/452050/7451687
cpp 3956726_wa.cpp
#include
#include
struct node
{
double pos;
int y, g, r;
int tot;
}l[10];
int main()
{
int n, i, j;
int m[100];
double v;
double t;
int cas = 1;
whil