代码搜索：Num
找到约 10,000 项符合「Num」的源代码
代码结果 10,000
www.eeworm.com/read/460309/7253943
txt pcnnmm.txt
name=15;
%F=imread(['lena0.',num2str(name),'.bmp']);
%F=imread(['barbara0.',num2str(name),'.png']);
F=imread(['fingerprint0.',num2str(name),'.png']);
F=im2double(F);
[m,n]=size(F);
row1=F(1,:);
www.eeworm.com/read/436253/7254346
ָ
#define N 10
#include
main()
{
float average(float *p,int n);
float num[N];
float aver;
int i;
for(i=0;i
www.eeworm.com/read/460180/7256375
m offcp.m
function output=offCP(input,Num);
output=[];
for j=1:26
for i=1:1024
output(i,j)=input(i+Num,j);
end
end
www.eeworm.com/read/460020/7258778
m example6_31.m
num=[1 3];
den=conv(conv(conv([1 0],[1 5]),[1 6]),[1 2 2]);
cpole=rlocus(num,den,[33:1:37]);
range=[33:1:37]';
[range,cpole]
www.eeworm.com/read/459969/7260084
java jlab0304_3.java
class JLab0304_3{
public static void main(String[] args){
int i,j,n,num,result,num1;
System.out.println("所以的水仙数 ");
for(i=100;i
www.eeworm.com/read/459044/7283919
m ch1example1prg2.m
% ch1example1prg2.m
g=9.8; % 重力加速度
for L=1:5 % 仿真重复5次以便于观察
v=0; % 初始速度
s=0; % 初始位置
t=0;
dt=0.01;% 计算步长
for k=1:200
v=v+g*dt; % 速度
s=s+v*dt;
www.eeworm.com/read/458870/7286594
c 15rkey0.c
#define HEAPSORT struct student
#define KEY score
HEAPSORT
{ int num;
char name[8];
char sex;
int age;
double score;
};
#include "stdio.h"
#includ
www.eeworm.com/read/458870/7286618
c 15hkey0.c
#define HEAPSORT struct student
#define KEY name
HEAPSORT
{ int num;
char name[8];
char sex;
int age;
double score;
};
#include "stdio.h"
#include
www.eeworm.com/read/458870/7286633
c 15ikey0.c
#define HEAPSORT struct student
#define KEY age
HEAPSORT
{ int num;
char name[8];
char sex;
int age;
double score;
};
#include "stdio.h"
#include
www.eeworm.com/read/458808/7289049
cpp pattern.cpp
// Pattern.cpp
#include "stdafx.h"
#include "Pattern.h"
extern int dim;
double Pattern::Distance(const Pattern x1, const Pattern x2)
{
double temp = 0.0;
for(int i=0;i