代码搜索：continue

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

代码结果 10,000
热门代码： main.c GPIO I2C SPI UART timer interrupt ADC PWM LED
www.eeworm.com/read/452638/7436675

cpp main.cpp

/* Name: 没有数据结构版本的8皇后程序 Copyright: Author: 夏敏 Date: 06-08-08 13:56 Description: 意料之外的乱，开始以为会比较简单的，结果代码非常凌乱。 写完之后我发现其实只用作一半的循环，后一半结果和前一半结果是对称的。 */ #include us
·
www.eeworm.com/read/452217/7445037

m gademo2.m

% GADEMO2 clf; figure(gcf); echo on clc % This demonstration show the use of the genetic toolbox to optimize a % multi-dimensional non-convex function. % The function is coded in the coranaEva
·
www.eeworm.com/read/452050/7448585

cpp 3577007_ac_532ms_508k.cpp

#include int map[300][300]; int n, m, t; void floyd() { int i, j, k; for(k = 0; k < n; k++) { for(i = 0; i < n; i++) { if(map[i][k] != 0) { for(j = 0; j
·
www.eeworm.com/read/452050/7448586

cc 3577010_ac_610ms_612k.cc

#include int map[300][300]; int n, m, t; inline void floyd() { int i, j, k; for(k = 0; k < n; k++) { for(i = 0; i < n; i++) { if(map[i][k] != 0) { for(j =
·
www.eeworm.com/read/452050/7448830

c 2976693_ac_0ms_148k.c

#include int dis[20002]; int over; int n; void find(int st,int m,int s,int t) { int i; if(over) return ; if(s==t) { over = 1; printf("%d\n",m); return ; }
·
www.eeworm.com/read/452050/7448896

cc 4171890_ac_0ms_312k.cc

#include #include int N, M, S; int R[22], H[22]; int min[22], minarea[22]; int max(int floor) { int i, r, h, ret; r = R[floor+1]-1; h = H[floor+1]-1; ret = 0;
·
www.eeworm.com/read/452050/7448897

cc 3183494_ac_0ms_216k.cc

#include #include int N, M, S; int R[22], H[22]; int min[22], minarea[22]; int max(int floor) { int i, r, h, ret; r = R[floor+1]-1; h = H[floor+1]-1; ret = 0;
·
www.eeworm.com/read/452050/7448898

cpp 4171889_ce.cpp

#include #include int N, M, S; int R[22], H[22]; int min[22], minarea[22]; int max(int floor) { int i, r, h, ret; r = R[floor+1]-1; h = H[floor+1]-1; ret = 0;
·
www.eeworm.com/read/452050/7448899

cpp 3183493_ac_15ms_160k.cpp

#include #include int N, M, S; int R[22], H[22]; int min[22], minarea[22]; int max(int floor) { int i, r, h, ret; r = R[floor+1]-1; h = H[floor+1]-1; ret = 0;
·
www.eeworm.com/read/452050/7449008

c 2356170_tle.c

#include #include int m, d; struct node { int num; int adj[1002]; int id; int x, y; }pot[1002]; int mended[1003]; int dis(int i,int j) { return (pot[i].x-pot
·