代码搜索:N1

找到约 6,450 项符合「N1」的源代码

代码结果 6,450
www.eeworm.com/read/273718/10903508

cpp test.cpp

// test.cpp : 定义控制台应用程序的入口点。 // #include //读文件用的 #include "stdafx.h" #include #include #define N1 150 //断面数 #define N2 20 //断面的分层数 #define N3 50 //计算次数 #define G
www.eeworm.com/read/469754/6926287

cpp 2566.cpp

#include using namespace std; int main() { int n,m,i,j,k,n1,n2,n5,cnt,ca; while(scanf("%d",&ca)!=EOF) { while(ca--) { cnt=0; scanf("%d%d",&n,&m); for(n5=0;n5*5
www.eeworm.com/read/466942/7024071

m halton.m

function h=Halton(n,b) n0 = n; h = 0; f = 1/b; while (n0 > 0) n1 = floor(n0/b); r = n0 - n1*b; h = h+f*r; f = f/b; n0=n1; end
www.eeworm.com/read/463041/7190143

c fan.c

#include #include int main() { int n1,n2,n3,n[11]={9,8,7,6,5,4,3,2,1,0,0},ns=0; while(n[10]==0) { if(n[9]
www.eeworm.com/read/445094/7599482

frm frmbelt.frm

VERSION 5.00 Begin VB.Form Frmbelt BorderStyle = 1 'Fixed Single Caption = "普通V带传动原始参数输入" ClientHeight = 7725 ClientLeft = 45 ClientTop = 435
www.eeworm.com/read/443020/7639366

m jilei.m

function y=jilei(x) %做积累 %%%%%%%%%%%%%%%%%%%%%%%%%%% [M,N]=size(x); N1=N/10; y=zeros(M,N1); for i=1:N1 for j=1:10 y(1:M,i)=y(1:M,i)+x(1:M,i*j); end end w=y(:)'; i=0:length(
www.eeworm.com/read/441652/7667706

cpp 广度搜索.cpp

#include #include int n;// open结构的指针 int w=0; char start[10]; char end[9]={'1','2','3','8','0','4','7','6','5'};//目标节点 typedef struct ma { char shuma[9]; char operation; i
www.eeworm.com/read/299682/7839511

m jilei.m

function y=jilei(x) %做积累 %%%%%%%%%%%%%%%%%%%%%%%%%%% [M,N]=size(x); N1=N/10; y=zeros(M,N1); for i=1:N1 for j=1:10 y(1:M,i)=y(1:M,i)+x(1:M,i*j); end end w=y(:)'; i=0:length(
www.eeworm.com/read/142713/12929918

m new1lyapunov.m

function [Texp,Lexp]=new1lyapunov(n,rhs_ext_fcn,fcn_integrator,tstart,stept,tend,ystart,ioutp,d); % % Lyapunov exponent calcullation for ODE-system. % % The alogrithm employed in this m-file
www.eeworm.com/read/241836/13113627

m chkdat.m

function [n1,k]=chkdat(sd,pn,n1) n=length(n1); k=0; for i=1:n i1=0; for j=1:sd if(n1(i)==pn(j)) i1=1; n1(i)=j; break; end end