xrigger-tnteger-setter

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

线性表的创建 删除 查找 插入 输出等功能(linearlist create delete find insert print)

编写一个函数，要求输入年月日时分秒， 输出该年月日时分秒的下一秒。 如输入2011年12月31日23时59分59秒， 则输出2012年1月1日0时0分0秒。 需要考虑闰年 和 2月的特殊情况 (Write a function that requires input date, hour, minute and second outputs of the date when the next second. If the input at 23:59:59 on December 31st, 2011, output at 0:00:00 on January 1, 2012. Leap year and February need to consider the special case)

VC++从DLL中获得资源的小实例源代码，从DLL中获得背景图像，可者是一个图标资源或是其它类型的文件，总之，学会了一种，就可以举一反三，灵活掌握了。(VC++ from the DLL resources, source code examples to get a background image from the DLL, can an icon resource, or other types of documents, in short, learned, you can learn by analogy, flexibility.)

基于逆波兰法的计算器程序，该计算器支持小数输入和正负数输入，支持四则运算以及指数运算，也支持括号的使用。(Reverse Polish law based calculator program, the calculator supports input and negative decimal number input, support four operations and index calculation, and also supports the use of parentheses.)

修改过的GH0ST界面和功能调整，增加启动FLASH(Revised GH0ST interface and functionality adjustments to increase the boot FLASH)

输入一个矩阵，可以求得该矩阵的逆矩阵，内附解释说明(Enter a matrix, you can obtain the inverse matrix, containing an explanation)

本程序为VC++ 6,0的部分学习代码,有助于初学者学习,(This procedure is vc++ 6, 0 part learning code, can help beginners to learn,)

计算一个整数的和的积德最大值，即最优整数的接的最大值(The Jide calculate an integer, and the maximum value, i.e. the optimal integer then the maximum)

编写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.)