VOF

NodeJs开发的DNF简易GM工具,可以登录注册,发送TP,SP,QP,邮件,解封(DNF Simple GM Tool Developed by NodeJs)

说明：  用SDK编写的异形位图演示窗口VC源代码(VC source code of special-shaped bitmap presentation window written with SDK)

Testional good fon for desktop

附带源码，下载直接点击exe文件就可以获得外网IP。(With source code, download exe file directly click access to external networks on IP.)

Using vc to achieve com technology

version sample soruce code for csharp from msdn.

一个C/S模式的带P2P的 聊天 文件传输 的软件，也获得优秀毕业论文。-a C/S mode chatting with P2P file transfer software, has been outstanding dissertation.

DEM数据的读入与显示，里面包含了所用的实验数据，调通，代码可以用(DEM data read and display, which contains experimental data used, transferred through, the code can be used)

服务器端通过socket()系统调用创建一个Socket数组后(即设定了接受连接客户的最大数目)，与指定的本地端口绑定bind()，就可以在端口进行侦听listen()。如果有客户端连接请求，则在数组中选择一个空Socket，将客户端地址赋给这个Socket。然后登录成功的客户就可以在服务器上聊天了。-Server-side through the socket () system call to create a Socket after the array (that is set to receive the maximum number of connected customers), with a specified local port to bind bind (), will be able to listen on port listen (). If the client has to connect the request, then select an empty array Socket, the client address assigned to the Socket. And then sign in the success of customers can chat on the server.

zoj094 Matrix multiplication problem is a typical example of dynamical programming. Suppose you have to evaluate an expression like A*B*C*D*E where A,B,C,D and E are matrices. Since matrix multiplication is associative, the order in which multiplications are performed is arbitrary. However, the number of elementary multiplications needed strongly depends on the evaluation order you choose. For example, let A be a 50*10 matrix, B a 10*20 matrix and C a 20*5 matrix. There are two different strategies to compute A*B*C, namely (A*B)*C and A*(B*C). The first one takes 15000 elementary multiplications, but the second one only 3500. Your job is to write a program that determines the number of elementary multiplications needed for a given evaluation strategy. (Matrix multiplication problem is a typical example of dynamical programming. Suppose you have to evaluate an expression like A*B*C*D*E where A,B,C,D and E are matrices. Since matrix multiplication is associative, the order in which multiplications are performed is arbitrary. However, the number of elementary multiplications needed strongly depends on the evaluation order you choose. For example, let A be a 50*10 matrix, B a 10*20 matrix and C a 20*5 matrix. There are two different strategies to compute A*B*C, namely (A*B)*C and A*(B*C). The first one takes 15000 elementary multiplications, but the second one only 3500. Your job is to write a program that determines the number of elementary multiplications needed for a given evaluation strategy. )