代码搜索：Num
找到约 10,000 项符合「Num」的源代码
代码结果 10,000
www.eeworm.com/read/396528/8101499
java getchinamoney.java
package bean;
public class GetChinaMoney {
public String getConvert(char num) {
if (num == '0') {
return "零";
} else if (num == '1') {
return "壹";
} else if (num == '2') {
www.eeworm.com/read/396426/8108667
cpp client.cpp
#include
class client
{
public:
int stime;//服务时间
int wtime; //等待时间
};
client *c;
int main()
{
int n,num;//顾客数
cin>>n;
num=n;
c=new client[n+1];
int i,j;
for(i
www.eeworm.com/read/296365/8108756
m mud.m
%在DS-spread spectrum系统中,噪声为加性高斯白噪声,传统单用户检测,线性解相关多用户检测和最小均方误差多用户检测的性能比较
clear all
close all
clc;
prompt={'Enter the numbers of user:','Enter the length of user code:','Enter the power of the user code'
www.eeworm.com/read/196254/8109418
cpp huaffmantree.cpp
#include
#include
#define NUM 4 //字母数
#define TNUM 7 //
#define LTH 4 //编码最大长度
class Node
{
public:
char data;
int weight;
int parent;
int lchil
www.eeworm.com/read/196183/8111759
cpp graph.cpp
#include "graph.h"
#include "share.h"
#include
#include
#include
/************************************************************************/
/*从文件中读入图像信息并构成图像
/*
www.eeworm.com/read/296279/8112987
cpp lab_5.cpp
//#include
#include
#include
#include
#include
#include "draw.h"
#include
#include
#define MAXSIZE 100
typedef st
www.eeworm.com/read/296223/8116792
cpp clustering.cpp
#include "stdafx.h"
#include "Clustering.h"
#include "stdio.h"
#include "math.h"
/******************************************************************************
/* Name: LBGCluster
/* Functio
www.eeworm.com/read/396171/8120433
~pas clinicregform.~pas
unit ClinicRegForm;
interface
uses
Windows, Messages, SysUtils, Variants, Classes, Graphics, Controls, Forms,
Dialogs, ADODB, StdCtrls, DB, ExtCtrls, ComCtrls, ToolWin, ImgList;
type
www.eeworm.com/read/396171/8120495
pas clinicregform.pas
unit ClinicRegForm;
interface
uses
Windows, Messages, SysUtils, Variants, Classes, Graphics, Controls, Forms,
Dialogs, ADODB, StdCtrls, DB, ExtCtrls, ComCtrls, ToolWin, ImgList;
type
www.eeworm.com/read/396153/8123526
cpp mergesort.cpp
# include "iostream.h"
# include "time.h"
# include "stdlib.h"
void merge(int *p,int low,int mid,int high)
{
int *q;
int x=high-low+1;
q=new int[x];
int s=low;
int t=mid+1;
int k=0