4用户指南Lonworks NodeBuilder Gizmo

实现长整数型的运算，加 减 乘 等 解决了越界的问题 可以计算两百位的数！-achieve long-integer arithmetic, as modified by the cross-border solution to the problem of calculating the number 200!

可以设定1～6方同时游戏，每一方都可以设定为电脑、网络或本地。左键下子，右键确定。游戏界面美观，很不错。开发工具：VC++6.0 和 MFC -can set a party to six games while, each side can be created for the computer, network or local. Left Now, the right to determine. Games beautiful interface, very good. Development tools : VC 6.0 and MFC

java 课件介绍JAVA语言的入门知识-java software JAVA language introduction introductory knowledge

mjpeg解码的类，适合进行mjpeg和jpeg之间的转化-MJPEG codec class, suitable for MJPEG and jpeg conversion between

实现简单的分割视图并在其中实现计数器功能,以及简单的绘图-simple segmentation View in which to achieve and counter functions, and simple graphics

汽车开环和闭环制动系统简述有助初学者加深对该模型原理的理解-car open and closed loop braking system outlined help beginners deepen their understanding of the principles Model

一：问题描述 针对某个集体（比如你所在的班级）中的“人名”设计一个哈希表，使得平均查找长度不超过R，完成相对的建表和查表程序。 二：基本要求 假设人名为中国人姓名的汉语拼音形式。待填入哈希表的人名共有30个，取平均查找长度的上限为2。哈希函数用除留余数法构造，用伪随机探测再散列法处理冲突。 三：实现提示 如果随机函数自行构造，则应首先调整好随机函数，使其分布均匀。人名的长度均不超过19个字符（最长的人名如：庄双双（ZHAGN SHUANG SHUANG）。字符的取码方法可直接利用C语言中的tosacii函数，并可对过长的人名先作折叠处理。 四：需求分析 本演示程序是对哈希表的建立和查找进行演示，主要数据来自自己编写的人名“A~~Z”等字母组成，拼音由开头的字母组成的词组，查找时用伪随机探测再散列法处理冲突。随机产生人名的位置。具体的程序内容在源程序里面有比较详细的解析。程序的运行在下列有详细的介绍。 -one : Problem description against any collective (such as your own classes) of "names" design a hash table. you make the average length of not more than R, completes the construction and Lookup Table procedures. Two : the assumption that the basic requirements were known as the Chinese name of Chinese pinyin form. Hash Table question Enter the names of a total of 30, you take the average length of a maximum of two. Hash functions with a few exception I stay constructed using pseudo-random re-hash detection method to resolve disputes. 3 : Achieving suggested ra

csharp写的一个贪吃蛇游戏程序，一个经典的游戏，适合新手学习csharp-CSharp written procedures for a Snake game, a classic game, suitable for novice learning CSharp

教学用的迷宫示例程序，自己设置迷宫，程序打印走过路径。内有文档说明算法原理-teaching examples of the maze procedure, set up its own maze, procedures Print traversed path. Within a document illustrates the algorithm Principle

本例所使用的包的源描述超过了演示版限制的300行, 如果您需要对其进行编译与模拟,请与北京理工大学 ASIC研究所联系,获取Talent系统的完全版本. 联系方法: 电话:010-68912434 信函:北京理工大学ASIC研究所 刘明业 教授收 邮编:100081-In this case used to describe the source package for more than a demo version of the 300 line limit, if you need to be compiled with the simulation, please contact ASIC Institute of Beijing Institute of Technology to obtain the complete version of Talent system. Contact: Tel: 010-68912434 correspondence: Institute of Beijing Institute of Technology Professor Liu Mingye ASIC received Postcode: 100081