代码搜索：Num
找到约 10,000 项符合「Num」的源代码
代码结果 10,000
www.eeworm.com/read/422731/10615248
htm 16.15 身份证的验证.htm
标题页
function isCardNo(num)
{
if (isNaN(num)) {alert("输入的不全是数字！"); return fals
www.eeworm.com/read/159770/10618641
c 递归车厢.c
/**********递归题改为非递归题实例 车厢********/
#include
#define MAX 4
int stack[MAX],p=-1;
struct
{
int num;
int sign;
}train[MAX];
void sub()
{
int inc;
if(p==MAX-
www.eeworm.com/read/159744/10620133
m myga.m
function [f,x]=myga(num,bounds,N,CP,P)
%[f,x]=ga(num,bounds,fun,N,CP,P)
%[f,x]=myga([],bounds,[],[],[])
%该遗传算法适用于：
% 目标函数为求最大值，且解非负整数解
%bounds 边界约束
%Myfun 为目标函数
%num
www.eeworm.com/read/422656/10622601
c reader.c
#include "nucleus.h"
#include "uart_defs.h"
#include "Reader.h"
#include "Key.h"
#define HISR_STACK_SIZE 4096
//extern VOID ERC_System_Error(INT error_code);
NU_TIMER track2_show;
NU_TIM
www.eeworm.com/read/351673/10630864
txt 一道c语言的试题.txt
从键盘读入一个字符转（长度小于256），将其中连续的数字作为一个整数，一次存放到一个的数组a(元素个数 10)中。若出现相同的数字，则只储存一个。如：输入“a123x456 17960？302tab5876”，将132放在a[0]，456放在a[1]，。。。。然后将其按照从小到大的顺序进行排序，最后按次序输出到标准输出上。
#include
#include ...
www.eeworm.com/read/277448/10638250
m offcp.m
function output=offCP(input,Num);
output=[];
for j=1:26
for i=1:1024
output(i,j)=input(i+Num,j);
end
end
www.eeworm.com/read/351570/10639446
cpp algo0502.cpp
Status FastTransposeSMatrix(TSMatrix M, TSMatrix &T) { // 算法5.2
// 采用三元组顺序表存储表示，求稀疏矩阵M的转置矩阵T
int col, t, p, q;
int num[20], cpot[20];
T.mu = M.nu; T.nu = M.mu; T.tu = M.tu;
if (T.tu
www.eeworm.com/read/277434/10639883
c 15rkey0.c
#define HEAPSORT struct student
#define KEY score
HEAPSORT
{ int num;
char name[8];
char sex;
int age;
double score;
};
#include "stdio.h"
#includ
www.eeworm.com/read/277434/10639946
c 15hkey0.c
#define HEAPSORT struct student
#define KEY name
HEAPSORT
{ int num;
char name[8];
char sex;
int age;
double score;
};
#include "stdio.h"
#include
www.eeworm.com/read/277434/10639984
c 15ikey0.c
#define HEAPSORT struct student
#define KEY age
HEAPSORT
{ int num;
char name[8];
char sex;
int age;
double score;
};
#include "stdio.h"
#include