代码搜索:预置数

找到约 10,000 项符合「预置数」的源代码

代码结果 10,000
www.eeworm.com/read/228447/14384169

c ad9851.c

//在每次发数之前都要进行RESET.这个已经包含在Datasend函数里了。 #include"SPCE061V004.H" extern long int k;//k为频率关键字 //////////////////////////////////////////////////////////////////////////// void datasend(void)
www.eeworm.com/read/226577/14457488

m mutation.m

function [newpop]=mutation(pop,pm) global popsize N length; for i=1:popsize if(rand
www.eeworm.com/read/125549/14486489

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/225997/14505054

jsp pagekey.jsp

记录数:, 第页/总页   9首页&nbs
www.eeworm.com/read/225637/14528861

c kb.c

#include "GP32C.H" #include "DJC.h" /*KB_Init:键盘初始化函数-------------------------------* *功 能:初始化键盘中断的引脚,但未开放键盘中断 * *参 数:无 * *返 回:无
www.eeworm.com/read/124325/14576466

cpp ex4_13.cpp

#include void move(char,char); void hanoi(int,char,char,char); void main(){ int n; cout
www.eeworm.com/read/124314/14577178

cpp ex4_13.cpp

#include void move(char,char); void hanoi(int,char,char,char); void main(){ int n; cout
www.eeworm.com/read/123877/14607686

cpp fibonacci2.cpp

#define MAXQSIZE1 11 //这里指定阶数,11表示11阶 #define MAX 9999999 typedef int QElemType; #include "..\include\queue1.cpp" #include "stdio.h" void main() { int temp,newAdd,newDel; SqQueue aQueue;
www.eeworm.com/read/222495/14688222

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/220921/14783600

cpp p4-197.cpp

#include #include #include using namespace std; //返回一个Fibonacci数,其由generate_n()算法调用 int Fibonacci1(void) { static int r; static int f1 = 0; sta