代码搜索：Mini
找到约 5,314 项符合「Mini」的源代码
代码结果 5,314
www.eeworm.com/read/275270/10825741
txt readme.txt
========================================================================
CONSOLE APPLICATION : Mini FtpServer
========================================================================
App
www.eeworm.com/read/349030/10855547
readme-first
$Id: README-FIRST,v 1.1.1.1 2003/03/30 18:55:39 al-guest Exp $
=============================================================================
minicom-1.78-s + lrzsz-0.12.16 X, Y, Zmodem protocols + mod
www.eeworm.com/read/418779/10900936
txt 11223.txt
Rule
--
Sid
11223
--
Summary:
This event is generated when an attempt is made to exploit a known vulnerability in Mini Search Appliance.
--
Impact:
Medium
--
Detailed Information:
The Saxon XSLT p
www.eeworm.com/read/458072/7313435
cpp 最小生成树.cpp
/*
pku 2485 Highways
*/
#include
using namespace std;
#define MAXN 501
#define info 100000000
typedef int elemtype;
int prim(int mat[][MAXN],int n)
{
elemtype lowcost[MAX
www.eeworm.com/read/458072/7313437
cpp 单源最短径dijkstra.cpp
#include
using namespace std;
#define MAXN 500
#define info 1000000
typedef int elemtype;
/*
功能：单源最短路径（权值类型可改，但必须非负）
参数：mat 邻接矩阵，n 结点个数，dist 最短路径，path 路径，s 开始位置
返回：最短路径和
*
www.eeworm.com/read/443457/7632637
cpp 1158.cpp
#include
#include
using namespace std;
int a[12];
int dp[12][1001];
int fire,hire,salary,mini;
int trans(int a,int b){
if(b>=a)
return (b-a)*hire+b*salary;
www.eeworm.com/read/436853/7761458
asv lvq.asv
function v=lvq(x,para,p)
%1初始化条件
etaz=para.etaz;%停止门限
N=para.it;%初识码字
i=0;
n=size(x,1);
c=para.clusters;%码书尺寸
fno=para.fno;
if(p==0)
s=para.s(1);%取得是矩阵的第一个数
else
s=para.s(p);
end
%---
www.eeworm.com/read/436853/7761462
m lvq.m
function v=lvq(x,para,p)
%1初始化条件
etaz=para.etaz;%停止门限
N=para.it;%初识码字
i=0;
n=size(x,1);
c=para.clusters;%码书尺寸
fno=para.fno;
if(p==0)
s=para.s(1);%取得是矩阵的第一个数
else
s=para.s(p);
end
%---
www.eeworm.com/read/436782/7762750
cpp obstt.cpp
#include
#include
int u,i,k,n,r[4][4],b;
float p[10],m[4][4],mini[10];
float min(float a[10])
{
float g;
g=1000;
for(int l=1;l