代码搜索:continue

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

代码结果 10,000
www.eeworm.com/read/101253/15839277

c 多位阶乘.c

/*计算 30000 的阶乘 !*/ /* This file "jiech2.c" created at 2001-08-24 20:15:22 by LeiPeng . */ #include #include #include #include #include
www.eeworm.com/read/101253/15839285

c 桃子猴.c

#include #include void main() { int total = 0; int n,b; scanf("%d%d",&n,&b); while(1) { int i = ++total; int j; for(j = 0; j< n;j++, i = (i-b)*(n-1)/n) {
www.eeworm.com/read/101057/15855845

cpp fax.cpp

#ifdef _WINDOWS #include #endif #include #include #include #include "fax.hpp" //send LONG nSkipDIS=3000; LONG nSendTSI =0; LONG nSendDCS
www.eeworm.com/read/101054/15855903

c config.c

/* config.C * John Viega * * Jan 28-29 2000 */ #ifdef HAVE_GETOPT_LONG #include #else extern "C" { // Hack for MS Windows #ifndef __cplusplus #define __cplusplus #endif #include "get
www.eeworm.com/read/100753/15865225

c 多位阶乘.c

/*计算 30000 的阶乘 !*/ /* This file "jiech2.c" created at 2001-08-24 20:15:22 by LeiPeng . */ #include #include #include #include #include
www.eeworm.com/read/100753/15865233

c 桃子猴.c

#include #include void main() { int total = 0; int n,b; scanf("%d%d",&n,&b); while(1) { int i = ++total; int j; for(j = 0; j< n;j++, i = (i-b)*(n-1)/n) {
www.eeworm.com/read/100612/15868853

c mersenne.c

/* * Program to calculate mersenne primes * using Lucas-Lehmer test - Knuth p.391 * * Try this only in a 32-bit (or better!) environment * * Copyright (c) 1988-1997 Shamus Software
www.eeworm.com/read/100612/15869062

c factor.c

/* * Program to factor Integers * * Current parameters assume a large 32-bit address space is available. * * This program is cobbled together from the implementations of various *
www.eeworm.com/read/100594/15870200

h traps.h

#pragma Traps #include boolean DISABLE(); /*TRUE = ENABLED*/ void RESTORE(boolean b); void Connect(unsigned int selector, Coroutine &old, Coroutine &new); void Continue(u
www.eeworm.com/read/100582/15871368

cpp mtext.cpp

#include"\sunshine\include\mtext.h" #include MText::MText(int x,int y,char *idname,char *text1,int fast) : MObj(x,y,0,16,idname) { int maxlength=0,maxwidth=0; int c=0; char wo