代码搜索：Num

找到约 10,000 项符合「Num」的源代码

代码结果 10,000
热门代码： main.c GPIO I2C SPI UART timer interrupt ADC PWM LED
www.eeworm.com/read/276699/7149366

bak hannuo.cpp.bak

// hannuo.cpp : Defines the entry point for the console application. // #include "stdafx.h" srtuct dish { int num[10]; int n; }; void move(int n,dish dismov,int a,int b,int c) { di
·
www.eeworm.com/read/350718/7149719

c bcd.c

/* 说明: 如果前面无特殊说明，这里的bcd.c中的所有的运算都是指标准的压缩BCD码\ (低位在前，高位在后)的运算. 写函数过程中的一些使用默认的术语(这里所说的非常的标准). Bin: 1字节标准二进制数. Hex: 1字节标准十六进制数 // 注: 这两个东西在值上面无区别, 只是在转换成ASCII码时有点差别. 举例如下: 若 ...
·
www.eeworm.com/read/461368/7153016

cpp approxmsttsp.cpp

#include using namespace std; const int vexMax = 30; typedef struct edge{ int begin; // 保存边的起始顶点 int end; // 保存边的结束顶点 int weigh; // 保存边的权值 }Edge; void Prim(int g[]
·
www.eeworm.com/read/464332/7165331

c jz.c

#include "mb95100.h" extern unsigned char keybuf; extern unsigned char menustate; unsigned int press[3],voltpress[3]; unsigned int temperature[3],volttem[3]; unsigned int flownum[3],voltflow[3];
·
www.eeworm.com/read/464332/7165348

c jz.c

#include "mb95100.h" extern unsigned char keybuf; unsigned int press[3],voltpress[3]; _YLJZ() { unsigned char num=0; unsigned char x=0; unsigned char buf[5]={0}; while(_Judgekey()!=0) { whi
·
www.eeworm.com/read/464287/7166560

m a45.m

%首先装载一原始信号 load nearbrk; s=nearbrk; %=========================== %画出该信号的波形图 subplot(4,2,1); plot(s); Ylabel('s'); title('原始信号s和信号的近似a、细节d'); %=========================== %用小波
·
www.eeworm.com/read/464189/7167795

cpp test.cpp

#include #include using namespace std; int main(int argc, char **argv){ int num; cin>>num; for(int i=2;i
·
www.eeworm.com/read/464179/7167946

h treesort.h

#include #define maxint 0x7fffffff //整型最大值 //--------------------------------建立初始排序树函数-----------------------------------// void treejust(node **t,node *d,int i,int num,int &jc,int &bc
·
www.eeworm.com/read/464179/7167947

h merge.h

#include //-------------------------------归并函数------------------------------------------// void merge(node *rs,node *d,int i,int m,int n) {//将有序rs[s...m]和rs[m+1...t]归并为有序的d[s...t] int k
·
www.eeworm.com/read/464179/7167951

h heapsort.h

#include //----------------------------调大顶堆函数-------------------------------------------// void heapadjust(node *d,int s,int m,int &jc,int &bc) {//已知d[s...m]中记录的关键字除之d[s]外均满足堆的定义，本函数调整d[s
·