代码搜索：Num

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

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

m exa120502.m

%-------------------------------------------------------------------------- % exa120502.m, for example 12.5.2 and fig12.5.4 %-----------------------------------------------------------------------
·
www.eeworm.com/read/379993/9169402

cpp classification.cpp

// Classification.cpp: implementation of the Classification class. // 2005.1.13－16：02 By Superman ////////////////////////////////////////////////////////////////////// #include "stdafx.h" //#i
·
www.eeworm.com/read/379991/9169548

txt 2004102815114230829.txt

八皇后问题 在一个8×8国际象棋盘上，有8个皇后，每个皇后占一格； 要求皇后间不会出现相互“攻击”的现象，即不能有两个皇后处在同一行、同一列或同一对角线上。 采用一维数组来进行处理。数组的下标i表示棋盘上的第i列，a[i]的值表示皇后在第i列所放的位置。 如：a[1]=5，表示在棋盘的第一例的第五行放一个皇后。 程序中首先假定a[1]=1，表 ...
·
www.eeworm.com/read/183319/9170437

cpp a.cpp

#include //#include #include #define NULL 0 #define N 1100 using namespace std; short *temp; class gaojingdu { private: short *a; int num; public
·
www.eeworm.com/read/183298/9171157

cpp xuanze.cpp

//通用选择排序法xuanze.cpp #include #include #include #include #define N 10 typedef bool (*isgreat)(void *this_num,void *next_num); void gensort(void *base,int
·
www.eeworm.com/read/182833/9188838

c gtitm.c

/* * Copyright (c) 2003-2005 Frank Dabek * Massachusetts Institute of Technology * * Permission is hereby granted, free of charge, to any person obtaining * a copy of this sof
·
www.eeworm.com/read/379679/9189220

cpp dazuoye1.cpp

#include #include #include typedef struct{ //建立一个字符的堆栈 char *base; char *top; int stacksize; }SqStack; void InitStack(SqStack &s) {
·
www.eeworm.com/read/182707/9194982

m input_callback.m

function input_callback() %%%%%%%%%%%%%%%%%%%%% % defaut parameters % %%%%%%%%%%%%%%%%%%%%% A=[1 0 0 1]; %Φ(k+1,k) B=[.1 .3 .2 .2]; %Γ(k+1,k) H=[.1 2 .3 .4];
·
www.eeworm.com/read/182501/9201152

m input_callback.m

function input_callback() %%%%%%%%%%%%%%%%%%%%% % defaut parameters % %%%%%%%%%%%%%%%%%%%%% A=[1 0 0 1]; %Φ(k+1,k) B=[.1 .3 .2 .2]; %Γ(k+1,k) H=[.1 2 .3 .4];
·
www.eeworm.com/read/379288/9202746

java show.java

import java.awt.*; import java.awt.event.*; import java.io.*; import javax.swing.*; class Show extends JFrame { private Container container; private JButton ok; int count = Add.count;
·