代码搜索：n-j
找到约 136 项符合「n-j」的源代码
代码结果 136
www.eeworm.com/read/392856/8322419
m twtoten.m
function ten=twtoten (tw)
[m,n]=size(tw);
ten(1:m)=0;
for i=1:m
for j=1:n
ten(i)=ten(i)+tw(i,j)*2^(n-j);
end
end
www.eeworm.com/read/357858/10199687
m greenzhu.m
% ARMA(p,q)模型格林函数预测方法
clear;
p=input('输入自回归阶数：');
q=input('输入滑动平均阶数：');
N=input('输入已知数据的个数：');
l=input('输入做几期预测：');
for t=1:p
a(t)=input('输入自回归参数：');
end
for t=1:q
b(t)=input('输入滑动平均
www.eeworm.com/read/348596/10881968
txt 3042.txt
Problem Id:3042 User Id:fzk
Memory:15744K Time:153MS
Language:C++ Result:Accepted
Source
#include
#include
#include
int x[1001];
__int64 ans[1001][1
www.eeworm.com/read/452050/7451214
c 1873451_wa.c
# include
char str[5001];
short d[5001][5001]={0};
int main()
{
int n, i, j;
scanf("%d%s",&n,str);
for(i = 0; i
www.eeworm.com/read/452050/7451215
c 1873454_wa.c
# include
char str[5001];
short d[5001][5001]={0};
int main()
{
int n, i, j;
scanf("%d%s",&n,str);
for(i = 0; i
www.eeworm.com/read/452050/7451217
c 1873452_wa.c
# include
char str[5001];
short d[5001][5001]={0};
int main()
{
int n, i, j;
scanf("%d%s",&n,str);
for(i = 0; i
www.eeworm.com/read/247044/12691301
cpp alculator.cpp
// alculator.cpp : implementation file
//
#include "stdafx.h"
#include "p09005435.h"
#include "alculator.h"
#include "math.h"
#ifdef _DEBUG
#define new DEBUG_NEW
#undef THIS_FILE
static c
www.eeworm.com/read/367160/9777903
f zlatsp.f
SUBROUTINE ZLATSP( UPLO, N, X, ISEED )
*
* -- LAPACK auxiliary test routine (version 3.1) --
* Univ. of Tennessee, Univ. of California Berkeley and NAG Ltd..
* November 2006
*
*
www.eeworm.com/read/367160/9778153
f clatsp.f
SUBROUTINE CLATSP( UPLO, N, X, ISEED )
*
* -- LAPACK auxiliary test routine (version 3.1) --
* Univ. of Tennessee, Univ. of California Berkeley and NAG Ltd..
* November 2006
*
*
www.eeworm.com/read/414272/11122621
asv q3.asv
function Q3
[N M G]=data2
%将开头的0,转还成100
Mlen = length(M);
for i=1:Mlen
if(sum(M(i,:))==0)
continue;
end
mark=0;
for j=1:13
if(M(i,j)==0)
if(mark=