登录
首页 » Visual C++ » IPtext

IPtext

于 2011-11-18 发布 文件大小:1139KB
0 340
下载积分: 1 下载次数: 7

代码说明:

  VC++编写的IP侦查小程序 很实用(VC++ IP detection of small programs written in a very practical)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • frmBattery
    vb笔记本电池电量检测程序,有兴趣的就下载吧。(vb laptop battery detection procedures are interested to download it.)
    2013-07-25 07:23:14下载
    积分:1
  • 1286857427_22104_FT38772_at
    Accumulator code is source code for simulating accumulator.
    2012-05-02 12:36:07下载
    积分:1
  • TSP
    遗传算法解决TSP旅行商问题(可计算30个城市),用Visual C++编写,希望对大家有所帮助。(Genetic algorithm to solve TSP traveling salesman problem (calculate 30 cities), written in Visual C++, we want to help.)
    2020-10-28 14:00:00下载
    积分:1
  • MyMFC
    说明:  在视图区画正弦函数曲线,并且在一个菜单下以对话框形式输入正弦图的起点和终点坐标。(In the view area sine curve drawing, and in the form of a menu in the dialog box enter the start and end the sine map coordinates.)
    2011-04-02 17:02:04下载
    积分: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
  • down
    说明:  一个复杂的工程通常可以分解成一组小任务的集合,不错(A complex project can usually be broken down into a collection of small tasks.)
    2018-12-30 10:57:37下载
    积分:1
  • Jacobi
    数值分析分析中 用jacobi迭代求解线性方程(Analysis of numerical analysis using jacobi iteration for solving linear equations)
    2009-06-13 16:48:55下载
    积分:1
  • interactions
    qt实现的遗传算法 解决最大最小值得问题 (qt genetic algorithm to achieve the maximum and minimum worth solving problems)
    2013-12-13 02:50:38下载
    积分:1
  • RotationImage
    VB仿PhotoShop功能进行图像旋转,有需要的就下载吧。~(VB imitation PhotoShop image rotation function and has the need to download it. ~)
    2013-08-09 09:29:13下载
    积分: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
  • 696516资源总数
  • 106914会员总数
  • 0今日下载