代码搜索结果
找到约 10,000 项符合
N 的代码
n传教士与n野人问题(非a算法).cpp
#i<mark>n</mark>clude
#defi<mark>n</mark>e MAX<mark>N</mark>UM 100
//判断状态是否安全的数组
i<mark>n</mark>t used[MAX<mark>N</mark>UM][MAX<mark>N</mark>UM][2];
struct Status
{
i<mark>n</mark>t m;
i<mark>n</mark>t c;
i<mark>n</mark>t b;
}s[MAX<mark>N</mark>UM];//解路径
i<mark>n</mark>t <mark>N</mark>,K;
void i<mark>n</mark>it();//初始化函数
bool search(i<mark>n</mark> ...
sigshift.m
function [y,n] = sigshift(x,m,n0)
% implements y(n) = x(n-n0)
% -------------------------
% [y,n] = sigshift(x,m,n0)
%
n = m+n0; y = x;
sigshift.m
function [y,n] = sigshift(x,m,n0)
% implements y(n) = x(n-n0)
% -------------------------
% [y,n] = sigshift(x,m,n0)
%
n = m+n0; y = x;
sigshift.m
function [y,n] = sigshift(x,m,n0)
% implements y(n) = x(n-n0)
% -------------------------
% [y,n] = sigshift(x,m,n0)
%
n = m+n0; y = x;
sigshift.m
function [y,n] = sigshift(x,m,n0)
% implements y(n) = x(n-n0)
% -------------------------
% [y,n] = sigshift(x,m,n0)
%
n = m+n0; y = x;
sigshift.m
function[y,n]=sigshift(x,m,n0)
%Generate y(n)=x(n-n0)
%------------------------------------
%[y,n]=sigshift(x,m,n0)
%
n=m+n0;y=x;
sigshift.m
function [y,n] = sigshift(x,m,n0)
% implements y(n) = x(n-n0)
% -------------------------
% [y,n] = sigshift(x,m,n0)
%
n = m+n0; y = x;
sigshift.m
function [y,n] = sigshift(x,m,n0)
% implements y(n) = x(n-n0)
% -------------------------
% [y,n] = sigshift(x,m,n0)
%
n = m+n0; y = x;
sigshift.m
function [y,n] = sigshift(x,m,n0)
% implements y(n) = x(n-n0)
% -------------------------
% [y,n] = sigshift(x,m,n0)
%
n = m+n0; y = x;
上教精读第六册.dst
prese<mark>n</mark>tatio<mark>n</mark>[,prez2<mark>n</mark>'tei62<mark>n</mark>]<mark>n</mark>.提出，呈递；介绍，报告
clie<mark>n</mark>t['klai2<mark>n</mark>t]<mark>n</mark>.委托人，当事人；顾客
obstacle['0bst2kl]<mark>n</mark>.障碍，障碍物，妨害
marketi<mark>n</mark>g['ma:kiti8]<mark>n</mark>.营销
eco<mark>n</mark>omics[i:k2'<mark>n</mark>0miks, i:,-]<mark>n</mark>.经济学；经济
accou<mark>n</mar ...