-
ch1
实现一个可编程表达式的计算器，并判断输入的表达式是否正确。(Expression of the realization of a programmable calculator, and determine the expression entered is correct.)
- 2009-05-25 18:50:16下载
- 积分：1
-
canvas
两个小船在移动的代码，主要是计时器的使用，利用回调函数显示动画(The two boats in the mobile code, the use of the timer, the use of a callback function to display the animation)
- 2012-04-21 11:19:33下载
- 积分：1
-
ADS_B_original
matlab做的模拟ADS-B数据的解码和信号处理整体流程(Matlab to do the simulation of ADS-B data decoding and signal processing the overall process)
- 2020-12-23 13:29:06下载
- 积分：1
-
776867
说明： 此系统由VC++ 6 0 MFC开发而成,主要实现一些基本的界面操作,如画笔画刷,文字改变字体颜色,以及时钟显示和小型购物系(This system is developed by VC 60 MFC. It mainly implements some basic interface operation, such as brush, text changing font color, clock display and small shopping department.)
- 2018-12-31 12:24:07下载
- 积分：1
-
youxiangtu
编写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.)
- 2008-06-14 02:33:57下载
- 积分：1
-
tongxunlu11
基于VC++的通讯录实现，使用MFC编程(VC++ based address book implementation using MFC programming)
- 2013-08-05 17:09:03下载
- 积分：1
-
SearchBirthday
生肖查询软件，小巧精致，原理很简单，初学者进入(Zodiac query software, compact, very simple principle, beginners to enter)
- 2013-01-05 14:22:05下载
- 积分：1
-
ERLANG
爱尔兰B公式的计算器，可以给定任意a，s，B中的2个，计算另一个，MFC(Ireland B formula calculator, you can determine the arbitrary a, s, B in two, another calculation, MFC)
- 2013-05-29 15:39:11下载
- 积分：1
-
Calendar
万年历（0-9999）（每行打印2个月）。(Calendar (0 to 9999) (2 months each line of print).)
- 2013-03-06 11:48:25下载
- 积分：1
-
closest_pair
分治法思想，求最邻近点对，考虑将所给的n个点的集合S分成2个子集S1和S2，每个子集中约有n/2个点，然后在每个子集中递归地求其最接近的点对(Divide and conquer ideas, find the nearest point to consider given the set S of n points into two subsets S1 and S2, each subset of about n/2 points, and then recursively find its focus in each sub-the closest point)
- 2013-12-07 16:46:26下载
- 积分：1
