代码搜索：continue
找到约 10,000 项符合「continue」的源代码
代码结果 10,000
www.eeworm.com/read/290420/8483697
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/189063/8492122
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/290066/8507499
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/289837/8523546
m d_truet.m
%D_TRUET HOSA Demo for computing true trispectrum (trispect)
echo off
% A. Swami Jan 20, 1995
% Copyright (c) 1991-2001 by United Signals & Systems, Inc.
% $Revision: 1.6 $
% RES
www.eeworm.com/read/289837/8523567
m d_arord.m
%D_ARORD HOSA Demo: Linear Processes - AR model order determination.
echo off
% Demo of arorder
% A. Swami Jan 20, 1995
% Copyright (c) 1991-2001 by United Signals & Systems, Inc.
%
www.eeworm.com/read/289837/8523619
m demgltst.m
%DEMGLTST HOSA Toolbox Demo: Tests for Gaussianity and Linearity
echo off
% A. Swami April 15, 1993
% Copyright (c) 1991-2001 by United Signals & Systems, Inc.
% $Revision: 1.5 $
www.eeworm.com/read/188596/8525579
cpp 1088.cpp
#include
int main()
{
int n,m,i,k,j,p;
int a[151];
int flag;
while(1)
{
scanf("%d",&n);
if(n==0) return 1;
for(m=2;;m++) /*m为搜索的值；*/
{
flag=0;
for(p=0;p
www.eeworm.com/read/188596/8525581
bak 1088.cpp.bak
#include
int main()
{
int n,m,i,k,j,p;
int a[151];
int flag;
while(1)
{
scanf("%d",&n);
if(n==0) return 1;
for(i=0;i
www.eeworm.com/read/188596/8525622
c 1080.c
#include
int a[100][100],cl[100],n,i,c,j;
void ppp(int k)
{
int r;
for(r=1;r
www.eeworm.com/read/188596/8525756
c 1104.c
#include
int main()
{
int r[37]={0};
char p;
int i,num,max=1;
while(1)
{
scanf("%c",&p);
if(p==10) break;
if(p>='0'&&p='A'&&p