talk_WSAAsyncSelect_code

基于MFC的TCP/IP socket编程，一个客户端程序，适合初学者学习，开发平台vs2015(TCP/IP SOCKRT programing based on MFC,A client program ,very good for first learner the develop platform is vs2015)

获取硬件信息 Get hardware information()

基于Winpcap的网络数据包抓取.开发环境VS2013(network packet capture based on Winpcap . Development environment: VS2013)

服务器与客户端分开的简单聊天程序，对于初学者有很大帮助。(Separate client and server simple chat program, very helpful for beginners.)

用socket实现客户端服务器上传下载传输文件(use socket download file)

socket编程，实现一个客户端，一个服务器，是学习socket编程的好代码(socket programming, a client, a server, is a good source to learn socket programming)

实时HTTP下载控件 一个实时显示进度条的HTTP下载控件，使用WINSOCK,支持断点续传。速度。使用mschart控件,计量比较准确.(HTTP download real-time control of a real-time display of HTTP download progress bar control, the use of WINSOCK, Supporting HTTP. Speed. MSChart use controls, a more accurate measurement.)

这个小程序比较实用，可以让你的电脑时间同步世界服务器提供的时间，这可是比较准确的时间哦！源代码在VC6.0下编译通过，程序不管是从学习角度还是使用角度都不错，点一下鼠标你的电脑时间就会自动更正至世界时间。右侧的列表内显示的是提供时间服务的服务器域名，当然你还可以收集更多的时间服务器地址，加入到列表中(This little program is more practical, you can synchronize your computer time world time server, this is the more accurate the time Oh! VC6.0 to compile the source code through the program regardless of the angle from the learning point of view or are good to use, point the mouse to your computer time is automatically corrected to the world time. The list on the right shows the domain name server to provide time service, of course, you can collect more time server address, adding to the list )

phrack有什么nb的地方：有人问我成为nb黑客（不是骇客）的捷径是什么？我发现这里面可以细分为：1.谁是nb的黑客？ 我的答案是phrack杂志上每个领域发表开拓性文章的人； 2.如何成为nb的黑客？ 我的答案是把phrack杂志大部分文章用几年时间全部真正弄懂 --不看文章，不查资料能把例子实现一遍，还能改--xscan作者(What place phrack nb: nb what I was asked to become a hacker (not a hacker) is a shortcut? I found that there can be subdivided into: (1) Who is nb hackers? My answer is to explore every area of ​ ​ published journal articles on phrack people 2 nb how to become a hacker? My answer is that most of the phrack magazine article a few years time all truly understand- do not look at the article, the example does not check the information can achieve it again, but also to change- xscan author)

通信网络的架设问题 若要在n（≥10）个城市之间建设通信网络，只需要架设n-1条线路即可(With the Dijksra algorithm to network G from source points to the rest of the vertices of the shortest path)