代码搜索：Num
找到约 10,000 项符合「Num」的源代码
代码结果 10,000
www.eeworm.com/read/383443/8946389
c xiugaideq.c
#include
#include
#include
#include
#include
double uniform(double a,double b)//随机数；
{
double m,n;
m=b-a;
n=a+(double)(m*rand()/(RA
www.eeworm.com/read/383237/8959789
txt huffman source coding c language source code.txt
#include
#include
#include
#include
#include
#define MAXVALUE 10000 /*权值最大值*/
#define MAXLEAF 30 /*叶子最多个数*/
#define MAXNODE MAXLEAF*2-
www.eeworm.com/read/383218/8960434
c 雅可比迭代.c
#include
#include
void main()
{
float a[11][12],x[2][11],t,e;
int n,Num,i,j,k,flag=0;
printf("input iterative times:");
scanf("%d",&Num);
printf("input error rang:
www.eeworm.com/read/383218/8960436
c 高斯 赛德尔迭代.c
#include
#include
void main()
{
float a[11][12],x[2][11],t,e;
int n,Num,i,j,k,flag=0;
printf("input iterative times:");
scanf("%d",&Num);
printf("input error rang:
www.eeworm.com/read/383145/8968444
cpp 最短路径算法.cpp
#include
#define M 20 //最多顶点个数
#define up 10000 //定义一个无穷大的值
int cost[M][M] ; //带权的邻接矩阵
int dist[M],n; //dist为v0到各顶点的最短路程
struct
{
int num;
int pnode[M];
}path[M]; //path为从v0到各
www.eeworm.com/read/284042/8969290
c n!.c
#include
//#include
#include
#define MaxNum 10000
long nMax=0;
void LargeNumberTimes(long *num,long nTimes)
{
long z1,z2,z3=0;
for(z1=0;z1
www.eeworm.com/read/185980/8969296
cpp fig.11.cpp
// Fig.11
#include "stdafx.h"
#include
int _tmain(int argc, _TCHAR* argv[])
{
int n,m,num,i,a[8];
cout
www.eeworm.com/read/185977/8969403
c generating-degree.c
#include"stdio.h"
#include"math.h"
#include
#define N 150
#define A0 10895
main()
{ FILE *fp,*fp1;
int i,j,y=0;
static int num[N],totvertex;
float x,z=0,p,avedeg;
static do
www.eeworm.com/read/185941/8972121
c mergesort.c
#include "Stdio.h"
#include "stdlib.h"
#define NUM 100
void MergeSort();
void Merge();
int main(void)
{
int i;
int source[NUM];
int target[NUM];
for(i=0; i
www.eeworm.com/read/427128/8974497
pl genfilespectestdirs.pl
#!/usr/bin/perl -w
#
# "$Id$"
#
# This script generates a set of dummy files and directories for
# running FileSpecTest. They are in the form of
# fstest/ADMS###/RINEXOBS/S##1###A.##O