a support multiple files to upload 2, support a variety of file formats to uploa...

用C语言实现的闹钟程序.rar- Alarm clock procedure realizes which with the C language rar

C++ Primer的第三版结合了Stanley Lippman的实践经验和Josée Lajoie对于ANSI/ISO标准C++的深入理解。这本指导书的第三版已经被重新改写过，以便更加精确地讲述标准C++的特性和用法。在本书中，对于C++初学者特别有价值的是一些来自真实世界中的程序例子，它们说明了泛型程序(generic program)的设计、面向对象程序的设计、模板的用法，以及使用标准C++进行程序设计的方方面面。而且，本书也在适当的地方讲到了一些习惯用法以及效率指导。-C Primer combination of the third edition of the Stanley Lippman had practical experience and Jose; for ANSI/ISO C standard in-depth understanding. This third edition of the guide book has been redrafted too, to be more precise description of the C standard features and usage. In the book, for C beginners particular value of some real-world examples of the procedures, they show Generic procedures (generic program) in the design, object-oriented design, the use of templates, and the use of standard C for all aspects of the design process. Moreover, the book was also the right place describes some of the efficiency and usage guide.

一个在窗口显示实时曲线的源代码程序，非常不错-testcurve

dos 系统下 isa内猫模块的测试程序-dos systems within isa cat module testing procedures

matlab 源码,图象处理,增强,去燥,锐化-MATLAB

设计并制作出汽车信号灯微机控制系统； 2）所需执行的操作由相应的开关控制，所需控制的信号灯有： 仪表板左/右转向灯、左/右头灯和左/右尾灯及左/右刹车灯共8个灯，其驾驶操作与灯光信号对应关系如下： (1)左/右转弯(合上左/右开关)：仪表板左/右转向灯、左/右头灯、左/右尾灯闪烁。 (2) 紧急开关合上：除左右刹车灯以外，所有灯闪烁。 (3) 刹车(合上刹车开关)：左右刹车灯亮。 (4) 左/右转弯并刹车：仪表板左/右转向灯、左/右头灯、左/右尾灯闪烁，左右刹车灯 亮。 (5) 合上紧急开并关刹车：仪表板灯、头灯、尾灯闪烁，刹车灯亮。 (6) 停靠(合上停靠开关)：头灯、尾灯以20Hz的频率闪烁。 -designs and produces vehicle lights microcomputer control system; 2) the implementation of the operation from the corresponding switch control, the control signals required : the dashboard left/right shift lights, left/right front and left/right rear and left/right brake lights a total of eight lights, driving its operation and light signals corresponding relationships are as follows : (1) Left/right handers (Hopewell on the left/right switch) : the dashboard left/right turn signals, left/right headlight, left/right rear flashing. (2) emergency switch matches : Apart from the brake lights around outside, all lights flashing. (3) brakes (a switch on the brake) : about b

[输入] 图的顶点个数N，图中顶点之间的关系及起点A和终点B [输出] 若A到B无路径，则输出“There is no path” 否则输出A到B路径上个顶点 [存储结构] 图采用邻接矩阵的方式存储。 [算法的基本思想] 采用广度优先搜索的方法，从顶点A开始，依次访问与A邻接的顶点VA1,VA2,...,VAK, 访问遍之后,若没有访问B，则继续访问与VA1邻接的顶点VA11,VA12,...,VA1M，再访问与VA2邻接顶点...，如此下去，直至找到B，最先到达B点的路径，一定是边数最少的路径。实现时采用队列记录被访问过的顶点。每次访问与队头顶点相邻接的顶点，然后将队头顶点从队列中删去。若队空，则说明到不存在通路。在访问顶点过程中，每次把当前顶点的序号作为与其邻接的未访问的顶点的前驱顶点记录下来，以便输出时回溯。 #include int number //队列类型 typedef struct{ int q[20] -[imported] map of the number of vertices N, Vertex map of the relationship between the starting point and end point A and B [output] if A to B without path then exporting "There is no path" Otherwise output A to B on the path vertices [storage structure] plan adopted adjacency matrix of storage. [Algorithm for the basic idea] BFS way from the vertex A, A visit followed with adjacent vertices VA1, VA2 ,..., VAK, visiting times, if not visit B, continue to visit with the VA1 adjacent vertices VA11, VA12 ,..., VA1M. VA2 and then

sha-1算法是常用的数字摘要算法，例如

binary search tree.vcproj -binary search tree.vcprojbinary search tree.vcproj

寻最小支配集,用DP,复杂度是2^8 比2^150次方快多了-find the smallest dominating set with the DP, complexity is 2 ^ 2 ^ than eight 150-th power much quicker