-
QQ-leave-message
VB qq空间留言工具，init模拟发送数据包，模拟腾讯MD5加密传输账号密码(VB the qq space Message tool, init simulated send packets analog Tencent MD5 encrypted transmission account password)
- 2012-11-01 13:50:11下载
- 积分：1
-
singlepoint
说明： 全球定位系统单点定位程序，根据N文件和O文件解算地面点的坐标(Global positioning system, single point positioning procedure, in accordance with N documents and O document solver coordinates of ground points)
- 2008-11-16 10:12:50下载
- 积分：1
-
cell
原包机，模拟细胞的生长，分裂，和死亡,设定了几种不同的环境影响(The original charter, analog cell growth, division, and death)
- 2020-07-08 16:38:56下载
- 积分：1
-
TrainFinalVersion
这个程序是用堆栈来对火车排序的，该火车的车厢是乱的，经过排序后，火车的车厢变为顺序的，特点是使用VC编写的(This procedure is used to sort the stack to the train, the train is inside the chaos, after sorting, the train carriages into the order, characterized by the use of VC prepared)
- 2009-06-03 11:50:07下载
- 积分：1
-
75465246785
VB编写的超级卸载工具源代码,有需要的就下载吧。(Super uninstall tool written in VB source code, there is a need to download it.)
- 2013-07-25 21:32:44下载
- 积分：1
-
Big_Num
大整数阶乘的计算器，能计算上万的阶乘，不过速度有点慢(Large integer factorial calculator that can calculate the factorial of thousands, but a bit slow)
- 2010-01-22 12:24:30下载
- 积分：1
-
zcktwuy2
To achieve similar WORD2000 clip art menu code
- 2018-09-29 00:23:36下载
- 积分：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
-
HideWnd
VC编写的隐藏桌面窗口程序的工具，可以方便快速的一键隐藏和显示指定的程序！(VC hiding desktop windows program written in the tools that can facilitate the quick hide and show a button with the specified procedure!)
- 2010-01-06 14:04:43下载
- 积分：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
