keyboard

支持计算式编辑并计算，并提供常用方程，函数键盘，时间显示等功能(Support calculation formula editor and calculate and provide commonly used equations, function keyboard, the time display and other functions)

对Excell文件进行读写操作,并可以创建excell文件(Read and Write the excell file)

MFC编写的RS232 Demo,可供新手借鉴，VS可直接运行。(MFC RS232 Demo)

vb笔记本电池电量检测程序,有兴趣的就下载吧。(vb laptop battery detection procedures are interested to download it.)

说明：  2进制10进制16进制转换（包括整数小数）使用数组进行编程(Hex converter )

线性表的建立与基本运算1.采用表尾挂入法建立一个以la为头的单链表2.采用表首插入法建立一个yilb为头指针的单链表3.就地逆转以lb为头指针的单链表。 还有矩阵的链式存贮及运算。以一个c函数创建任一稀疏矩阵的十字链表。以一个c函数从十字链表的头指针起按行序及三元组形式输出十字链表中各节点的值

这是vb编写的计算器的源代码，比较容易懂，比较实用(This is the preparation of the calculator vb source code, it was relatively easy to understand, more practical)

String类，分享一下。可以实现==, >, <, [], <<, Trim, Reverse, Find, upper, lower等功能(String脌脿 拢 卢 脰脧铆脪 禄脧脗 隆 拢 驴 脡脪脭脢渭脧脰 ==,)

编写C程序，随机给出n*n的邻接矩阵，并打印输出邻接矩阵，以及有向图的边的个数，每个顶点的度，并判断该图中是否存在Euler回路： （1）如果为n阶，则随机产生一个n*n的邻接矩阵； （2）输出邻接矩阵，边的个数，每个顶点的度以及图中是否存在Euler回路。 这个题目涉及到了两个主要的知识点，一个是数据结构中的有向图的邻接矩阵的创建，还有就是离散数学中的Euler回路的判定定理。(The preparation of C procedures, were randomly given n* n s adjacency matrix and adjacency matrix printouts, as well as to map the number of edges, each vertex degrees, and determine the existence of the map Euler circuit: (1) If for n-order, then randomly generated a n* n adjacency matrix (2) output adjacency matrix, the number of edges, each vertex of degree as well as map the existence of Euler circuit. This topic relates to two main points of knowledge, a data structure of digraph adjacency matrix of creation, there is discrete mathematics in the loop to determine Euler theorem.)

Michael喜欢滑雪百这并不奇怪， 因为滑雪的确很刺激。可是为了获得速度，滑的区域必须向 下倾斜，而且当你滑到坡底，你不得不再次走上坡或者等待升降机来载你。Michael想知道在一 个区域中最长的滑坡。区域由一个二维数组给出。数组的每个数字代表点的高度。 (Michael likes to ski hundred This is not surprising, because the skiing is very stimulating indeed. However, in order to obtain speed, Waterloo regional must be downward-sloping, and when you slide into the base, you have to embark once again on the slope or to set you waiting for lifts. Michael would like to know the longest in a landslide area. Region is given by a two-dimensional array. Each figure represents an array of high points.)