网站首页

9

于 2008-06-24 发布文件大小:3560KB

 0  155

下载积分: 1 下载次数: 0

我要下载

代码说明：

说明：端口扫描。能够实现简单的端口扫描。源程序在VC6.0下编译哦难过。(Port scanning. To achieve a simple port scan. Under the compiler source code in VC6.0 Oh sorry.)

下载说明：请别用迅雷下载，失败请重下，重下不扣分！

发表评论

0 个回复

9
说明：端口扫描。能够实现简单的端口扫描。源程序在VC6.0下编译哦难过。(Port scanning. To achieve a simple port scan. Under the compiler source code in VC6.0 Oh sorry.)

2008-06-24 18:13:20下载

积分：1
端口扫描（终结版）
端口扫描程序（包括3种扫描方式）(a port scanner code(include 3 scan mode))

2020-11-01 21:29:55下载

积分：1
svb020404
说明：扫描Internet上一个IP地址的端口(Scan the ports of a IP address on Internet.)

2005-10-19 21:44:05下载

积分：1
Http
用libnids实现http协议的解析，可以监控局域网内所有机器访问的网站，并记录日志。使用前需要先配置好libnids的环境(Libnids realize using http protocol analysis, can monitor all LAN machines to visit websites and record the log. Need to use pre-configured environment libnids)

2020-07-02 20:20:01下载

积分：1
FindUdpPort
UDp端口扫描，可以扫描任意安装TCP/IP协议的主机，并且可以扫描该主机中的一个端口。点击UDP Scan按钮，实现对UDP端口的扫描过程。在Windows操作系统环境中，建议使用Visual C++编程工具实现。(UDp port scan, can scan any install TCP/IP protocol, host, and can scan a port in the host. Click on the UDP Scan button on the UDP port scanning process. In the Windows operating system environment, it is recommended to use Visual C++ programming tools.)

2012-07-29 09:58:36下载

积分：1
sanner
说明：扫描器C源码，大家可以研究一下再说吧，扫描漏洞的(Scanner C source code, we can look at to say it, scanning loopholes)

2010-05-03 14:06:10下载

积分：1
scanner
网络扫描器，实现tcp connect，tcp syn ，tcp fin，arp扫描，icmp主机发现(Network scanner, realize tcp connect, tcp syn, tcp fin, arp scan, icmp host found)

2020-11-01 21:09:55下载

积分：1
NW
说明：复杂网络，小世界网络NW的C++代码，并求了其度分布。(Networks, small world network NW in C++ code, and find out the degree distribution.)

2010-12-31 19:51:39下载

积分：1
Scan
简单的网络端口扫描器，包括ICMP扫描和connect扫描(Simple network port scanner, including ICMP scan and connect scan)

2020-11-01 20:59:55下载

积分：1
lab
对于初始给定的数组,通常存在多个长度大于1的已自然排好序的子数组段.例如,若数组a中元素为{4,8,3,7,1,5,6,2},则自然排好序的子数组段有{4,8},{3,7},{1,5,6},{2}.用一次对数组a的线性扫描就足以找出所有这些排好序的子数组段.然后将相邻的排好序的子数组段两两合并,构成更大的排好序的子数组段({3,4,7,8},{1,2,5,6}).继续合并相邻排好序的子数组段,直至整个数组已排好序。(For the initial given array, usually present multiple sub-array section has a length greater than a natural sorted. For example, if the array of elements for a {4,8,3,7,1,5,6,2} then naturally sorted subarray segment has {4,8}, {3,7}, {1,5,6}, {2}. used once on a linear array scanning is sufficient to identify all these rows subarray segments good sequence is then sub-arrays adjacent segments sorted pairwise merge to form larger sub-segments sorted array ({3,4,7,8}, {1, 2, 5,6}). Continue merge adjacent sorted subarray section until the entire array is sorted.)

2014-12-21 20:08:05下载

积分：1

696518资源总数
104271会员总数
57今日下载

9

0 个回复

热门标签

热门下载