代码搜索：预置数
找到约 10,000 项符合「预置数」的源代码
代码结果 10,000
www.eeworm.com/read/265874/11251695
java backtrace_nqueen.java
public class Backtrace_NQueen
{
static int n; //皇后个数
static int[] x; //当前解
static long sum; //当前已经找到的可行方案数
public static long nQueen(int nn)
{
n=nn;
sum=0;
www.eeworm.com/read/335238/12544557
cpp soldier.cpp
#include
#include
#include
#include
#include
int k = 0; //士兵数
int step = 0; //移动步数
bool order(int data[]); /
www.eeworm.com/read/334788/12572467
c uart0.c
#include
#include "eeprom.h"
#include
typedef unsigned char uchar;
/*******************************************
函数名称：InitUART
功 能：初始化UART端口
参 数：无
返回值 ：无
*****
www.eeworm.com/read/146694/12618032
cpp if_04.cpp
//if_04.cpp
#include
#include
void main()
{ int number,max=0; //设定最大的初值为0
do
{ cout > number;
if (number > max)
ma
www.eeworm.com/read/135779/13900441
m example71_figure.m
%example71_figure
%==============
%==============
figure('name','初始分布图示','numbertitle','off');
X=[0 1;0 1];
cluster=8;%%分类数
points=10;
std_dev=0.05;
P=nngenc(X,cluster ,points,std_dev);
www.eeworm.com/read/135754/13902564
m example71_figure.m
%example71_figure
%==============
%==============
figure('name','初始分布图示','numbertitle','off');
X=[0 1;0 1];
cluster=8;%%分类数
points=10;
std_dev=0.05;
P=nngenc(X,cluster ,points,std_dev);
www.eeworm.com/read/300426/13914816
cpp sushu.cpp
#include
void ss(int i);
void sushu()
{
int x;
do
{
cout
www.eeworm.com/read/134348/13995007
cpp lbc.cpp
// LBC.cpp : Defines the entry point for the console application.
//
#include "stdafx.h"
#include "BCHCode.h"
#include
#include
/*产生(a,b)区间上均匀分布的随机数*/
double uniform(doubl
www.eeworm.com/read/134069/14010942
txt 21-3.txt
/* 范例：21-3 try...throw...catch */
#include
void main(void)
{
int i, j;
cout j;
try
www.eeworm.com/read/133753/14026766
cpp if_04.cpp
//if_04.cpp
#include
#include
void main()
{ int number,max=0; //设定最大的初值为0
do
{ cout > number;
if (number > max)
ma