代码搜索：continue
找到约 10,000 项符合「continue」的源代码
代码结果 10,000
www.eeworm.com/read/452050/7449305
cpp 3063364_wa.cpp
#include
#include
using namespace std;
int a[15], v[14], m, n;
int dis[14][14];
int f[14][14][1
www.eeworm.com/read/452050/7449491
cc 3007404_tle.cc
#include
int press[17];
int ans, finish;
char str[5][5];
int valid(int x,int y)
{
if(x < 0 || y < 0 || x > 3 || y > 3)
return 0;
return 1;
}
void flip(int num)
{
int i
www.eeworm.com/read/452050/7449499
c 3020634_ac_0ms_148k.c
#include
int main()
{
int n, m, t;
int i, cas, ans;
int ar[1441];
scanf("%d",&cas);
while(cas--)
{
scanf("%d%d%d",&n,&t,&m);
for(i = 0; i < m; i++)
{
scanf("%d
www.eeworm.com/read/452050/7449542
c 1943700_ac_468ms_60k.c
# include
int main()
{
int C, N, i, j, min;
scanf("%d",&C);
while(C--)
{
scanf("%d",&N);
if(N
www.eeworm.com/read/452050/7449591
cpp 3196529_wa.cpp
#include
#include
int num[80000], no[80000];
int cnt;
int prime[1000001];
int init(int n)
{
int i, m, j;
memset(prime,0,sizeof(prime));
for(i = 3; i
www.eeworm.com/read/452050/7449592
cpp 3196540_ac_171ms_4684k.cpp
#include
#include
int num[80000], no[80000];
int cnt;
int prime[1000001];
int init(int n)
{
int i, m, j;
memset(prime,0,sizeof(prime));
for(i = 3; i
www.eeworm.com/read/452050/7449763
cc 2414422_tle.cc
#include
int res[50001];
int main()
{
int n, m, ans, t;
int a, b, i, j, cas = 1;
while(scanf("%d%d",&n,&m)==2)
{
if(!m&&!n)
return 1;
for(i = 0; i
www.eeworm.com/read/452050/7449764
cc 2414421_wa.cc
#include
int res[50001];
int main()
{
int n, m, ans, t;
int a, b, i, j, cas;
while(scanf("%d%d",&n,&m)==2)
{
if(!m&&!n)
return 1;
cas = 1;
for(i = 0; i
www.eeworm.com/read/452050/7449767
cc 2414419_tle.cc
#include
int res[50001];
int main()
{
int n, m, ans, t;
int a, b, i, j, cas = 1;
while(scanf("%d%d",&n,&m)==2)
{
if(!m&&!n)
return 1;
for(i = 0; i
www.eeworm.com/read/452050/7449794
cpp 3063431_ac_15ms_156k.cpp
#include
#include
using namespace std;
char page[77][77];
int w, h;
void print()
{
int i;
putchar('+');
for (i = 0; i < w; i++)
{
putchar('-');
}
put