代码搜索：预置数
找到约 10,000 项符合「预置数」的源代码
代码结果 10,000
www.eeworm.com/read/241769/13121551
h bucketsorter.h
//桶式排序类
#include "Sorter.h"
template
class BucketSorter:public Sorter
{
public:
void Sort(Record Array[],int n,int min,int max);
};
//桶式排序，Array[]为待排序数组，数
www.eeworm.com/read/240925/13187345
cpp sl312.cpp
// sl312.cpp : Defines the entry point for the console application.
//
#include "stdafx.h"
#include "iostream.h"
int main()
{
int num;
cout
www.eeworm.com/read/239530/13273919
asm b.asm
;模块B：
PUBLIC ASC_TO_BIN , BIN_TO_ASCII
DATA SEGMENT COMMON
INPUT_MESSAGE DB 0AH , 'PLEASE INPUT A NUMBER(LESS THAN 5 FIGURES):$'
IN_ASC_BUF DB 6 ;十进制数的输入缓冲
www.eeworm.com/read/136972/13350249
cpp xt3-20-2.cpp
#include
using namespace std;
int main()
{int m,s,i;
for (m=2;m
www.eeworm.com/read/319934/13439254
asm b.asm
;模块B：
PUBLIC ASC_TO_BIN , BIN_TO_ASCII
DATA SEGMENT COMMON
INPUT_MESSAGE DB 0AH , 'PLEASE INPUT A NUMBER(LESS THAN 5 FIGURES):$'
IN_ASC_BUF DB 6 ;十进制数的输入缓冲
www.eeworm.com/read/318362/13480630
java buttonblockmove.java
import java.awt.*;
import java.awt.event.*;
import java.applet.*;
class ButtonBlockMove extends Applet
{
final int RC = 4; // 行列数
final int N = RC*RC; // 块的个数
int []num = new int[N]; //数组n
www.eeworm.com/read/317271/13506658
java 扫雷.java
import java.awt.*;
import java.awt.event.*;
import javax.swing.*;
/*按扭类*/
class Bomb extends JButton
{
public int num_x,num_y; //第几号方块
public int BombRoundCount; //周围雷数
p
www.eeworm.com/read/316733/13518294
java findsafearea.java
//无雷联通区FindSafeArea
import java.awt.Point;
import java.util.Vector;
public class FindSafeArea
{
public FindSafeArea(){}
public Vector 确定无雷联通区(int i,int j,Block block[][],int 行数,int 列数)
{
www.eeworm.com/read/308467/13700609
m ante.m
clear;
SNR = [-5:2:10];
NumAntenna =4; %天线阵元数
Tlen = 1000; %训练序列长度
Dlen = 20000; %数据长度
step = 0.0001; %步长
alfa = pi/3; %波达方向
theta = pi/2;
for nEN = 1:length(SNR)
nu