代码搜索：N1
找到约 6,450 项符合「N1」的源代码
代码结果 6,450
www.eeworm.com/read/452050/7450553
cpp 3698007_ce.cpp
#include
#include
#include
#include
using namespace std;
int n, max;
struct node
{
int x, y;
}p[100], tp[100];
bool cmpx(node a, node b)
{
www.eeworm.com/read/452050/7450554
cc 3698093_wa.cc
#include
#include
#include
#include
using namespace std;
int n, ans;
struct node
{
int x, y;
}p[100], tp[100];
bool cmpx(node a, node b)
{
www.eeworm.com/read/448535/7531561
mma gs.mma
(* A Gram-Schmidt procedure *)
(* Copyright 1999 by Todd K. Moon *)
gs[p_,a_,b_,w_,t_] :=
(* p = list of input functions
a = lower limit of integration
b = upper limit of integration
www.eeworm.com/read/448535/7531571
m gs.m
function q = gs(P,a,b,w,t)
%
% Gram-Schmidt using symbolic toolbox
%
% function q = gs(P,a,b,w,t)
%
% P = list of functions in P(1), P(2), ...
% a = lower limit of integration
% b = upper lim
www.eeworm.com/read/321263/13409862
m programs_13d.m
% Chapter 13 - Three-Dimensional Autonomous Systems and Chaos.
% Programs_13d - Lyapunov exponents of the Lorenz system.
% Copyright Birkhauser 2004. Stephen Lynch.
% Special thanks to Vasiliy Go
www.eeworm.com/read/100603/6266252
c prlong.c
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
/*
* The contents of this file are subject to the Mozilla Public
* License Version 1.1 (the "License"); you may not u
www.eeworm.com/read/482119/6628037
m ymfitness1.m
function P=ymfitness1(P,d)
[n1,n2]=size(P);
A=P;
a=zeros(n1,1);
b=zeros(n1,1);
for i=1:n1
for j=3:2:n2-2
a(i)=a(i)+sqrt((A(i,j+3)-A(i,j+1)).^2+(A(i,j+2)-A(i,j)).^2) ;
A(i,1)=a(
www.eeworm.com/read/482119/6628046
asv ymfitness1.asv
function P=ymfitness1(P,d)
[n1,n2]=size(P);
A=P;
a=zeros(m1,1);
for i=1:n1
for j=3:2:n2-2
a(i)=a(i)+sqrt((A(i,j+3)-A(i,j+1)).^2+(A(i,j+2)-A(i,j)).^2) ;
A(i,1)=a(i);
b()=orang