代码搜索：预置数
找到约 10,000 项符合「预置数」的源代码
代码结果 10,000
www.eeworm.com/read/158454/11614283
m jishu.m
function row_no=jishu(H);
for j=1:length(H(:,1)) %H的列数
k=1;
for i=1:length(H(1,:)) %H的行数
if H(j,i)==1
row_no(j,k)=i;
k=k+1;
www.eeworm.com/read/260483/11723673
dat 123.dat
"2","*******","3","*******","11","*******","ABC","*******","A","*******","B","*******","C","*******","1","2","1","2","3","4","5","6","第1列"
"第2列"
"列数"
"行数"
"总行数"
"标题"
"行标1"
"行标2"
"行标3"
"列标"
"
www.eeworm.com/read/157109/11738555
txt kecheng.txt
#include
#include
#define m 4 //课程数
#define NULL 0
typedef struct stnode //学生结点类型
{
int id; //学号
char name[16]; //姓名
int subject[m]; //课程数据组
float ave; //
www.eeworm.com/read/156813/11762081
cpp p4-197.cpp
#include
#include
#include
using namespace std;
//返回一个Fibonacci数，其由generate_n()算法调用
int Fibonacci1(void)
{
static int r;
static int f1 = 0;
sta
www.eeworm.com/read/258816/11841128
cpp p4-197.cpp
#include
#include
#include
using namespace std;
//返回一个Fibonacci数，其由generate_n()算法调用
int Fibonacci1(void)
{
static int r;
static int f1 = 0;
sta
www.eeworm.com/read/345007/11847063
cpp pso.cpp
// PSO.cpp
//
#include
#include "Particle.h"
#include "ParSwarm.h"
class MyPSO : public CParSwarm
{
public:
MyPSO(int d, int n):CParSwarm(d, n){}; //构造函数，给出微粒维数和微粒个数
www.eeworm.com/read/155761/11850537
bas nlmivmainmodule.bas
Attribute VB_Name = "MainModule"
Sub Main()
Dim n As Integer, m As Integer
Dim s As String
' 3个未知数
m = 3
' 2次方程
n = 2
' 分配初值和解的内存
ReDim x(n) As Dou
www.eeworm.com/read/155095/11898967
txt 算法比较.txt
破圈法，边割法，避圈法的比较：
当图为连通且边树较少时，用破圈法较好
当图边数较多时，使用边割法和避圈法较好