代码搜索：continue

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

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

java loop.java

public class Loop { public static void main(String args[]) { int i=0,j=1; outerLoop:for(;j
·
www.eeworm.com/read/421164/10752177

cpp a.cpp

#include #include void main() { float sum,v,x,A,a[100],b[100],c[100][100]; float b0,b1,b2,b3,b4 ,y,dx,dy; float v1 ,xbzc,average ,bzc,sjwc; float sumx,sumdx,sumy,sum
·
www.eeworm.com/read/276185/10754498

install-sh

#!/bin/sh # # install - install a program, script, or datafile # This comes from X11R5 (mit/util/scripts/install.sh). # # Copyright 1991 by the Massachusetts Institute of Technology # # Permission to
·
www.eeworm.com/read/276185/10754940

install-sh

#!/bin/sh # # install - install a program, script, or datafile # This comes from X11R5 (mit/util/scripts/install.sh). # # Copyright 1991 by the Massachusetts Institute of Technology # # Permission to
·
www.eeworm.com/read/276181/10758284

c 逆阵.c

#include "stdio.h" float z[4][4],*y=z; /*定义一个全局二维数组用来存放N-1阶余子式,因为A的伴随矩阵除以|A|时会产生小数，因此定义成float而非int*/ int js(int *p,int n) /*计算行列式的函数*/ {int k=0,i,s2=0,s1=0,j,s,t; printf("\n"
·
www.eeworm.com/read/276181/10758393

c 十五人排序.c

/*原题： 一寝室有15个人，每天都要三人一行外出散步一次，要在一周 （7天）内 每个人都跟其他14人各散步一次，问每一天应该怎么安排？？ 要快点想哟！！！！ 都等一会15分钟*/ #include int anpai[7][5][3]; int biaozhi[16][16]; int i=0,j=0,k=0,a,total=0; void hui
·
www.eeworm.com/read/349916/10782303

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/349903/10785512

cpp williams.cpp

/* * Program to factor big numbers using Williams (p+1) method. * Works when for some prime divisor p of n, p+1 has only * small factors. * See "Speeding the Pollard and Elliptic Curve
·
www.eeworm.com/read/349903/10785529

c williams.c

/* * Program to factor big numbers using Williams (p+1) method. * Works when for some prime divisor p of n, p+1 has only * small factors. * See "Speeding the Pollard and Elliptic Curve
·
www.eeworm.com/read/349903/10785900

cpp irred.cpp

/* program to find smallest irreducible polynomial */ /* cl /O2 /GX irred.cpp polymod.cpp poly.cpp big.cpp monty.cpp ms32.lib */ #include #include #include #in
·