-
down
说明: 一个复杂的工程通常可以分解成一组小任务的集合,不错(A complex project can usually be broken down into a collection of small tasks.)
- 2018-12-30 10:57:37下载
- 积分:1
-
非常实用的一款计算器
说明: 这是一款非常实用的计算器,我认为其实用程度远远胜过Windows系统提供的计算器.主要特色是支持多项式运算,即可以一次输入整个多项式,并能够识别运算的优先级(利用堆栈实现)(This is a very practical calculator, I think far better than using Windows systems calculator. The main feature of polynomial Operational support, which can import an entire polynomials, and to identify the priority level computing (using stack realization))
- 2021-02-19 09:59:44下载
- 积分:1
-
sports1
用于运动会的统计.分数,那女子参赛情况的记录统计.(Statistics for the Games. Scores, and that the situation of the women)
- 2008-05-14 12:42:04下载
- 积分:1
-
CLOCK
钟面上的时针和分针之间的夹角总是在 0 ~180之间 ( 包括 0 和180 ) 。举例来说,在十二点的时候两针之间的夹角为 0 ,而在六点的时候夹角为180 ,在三点的时候为90 。本题要解决的是计算 12:00 到 11:59 之间任意一个时间的夹角。(The angle between the hour and minute hands of the clock face is always between 0 to 180 (including 0 and 180). For example, twelve o' clock, when the angle between the two pin 0, in the six o' clock when the angle is 180, three points for 90. This question must be resolved are the angle of the calculation of 12:00 to 11:59 any one time.)
- 2011-06-28 13:14:11下载
- 积分:1
-
simple_web_browser
source code for a very simple web browser!
- 2009-03-18 08:03:24下载
- 积分:1
-
linearlist
线性表的创建 删除 查找 插入 输出等功能(linearlist create delete find insert print)
- 2013-11-30 10:14:28下载
- 积分:1
-
wpecification-enumerators
Implement the base class of the control panel
- 2017-03-30 02:29:45下载
- 积分:1
-
tongxunlu
通讯录中的每一个信息包括姓名(规定字节数为15个)、电话(规定字节数为15个)和工作单位(最大字节数为30个)等信息。(Each information including the name of the mail list ( specified byte number 15 ), phone ( specified byte number 15 ) and work units ( the maximum number of bytes to 30 ) and other information.)
- 2013-01-24 21:08:29下载
- 积分:1
-
T函数产生方法
说明: 由于vc系统随机函数产生的数均匀分布,有时要用到正态分布和分布,这是两个小函数,让你们见笑了(vc system because of the random number function evenly distributed, and sometimes we had to use normal distribution and distribution, which is two small functions so that you laughed at the)
- 2005-11-12 20:01:45下载
- 积分: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