这是用c++做的一个小游戏能跑能动！呵呵希望喜欢！

Customize the String cla-Customize the String class

圣维南一维非恒定流明渠水力学模型,该模型利用普林士曼Preismann隐格式求解，方法是追赶法和迭代法。-Saint-Venant one-dimensional unsteady flows lumens mechanical model, the model used Pulinshiman Preismann Hidden format solution is to catch up with the law and iterative method.

一个线程驰的类, 下面的是基本的使用方法 struct TSession { SOCKET socket int id } class myIocp:public CIOCP { public: void OnRead(void * p, char * buf, int len) void OnAccept(SOCKET socket) void OnClose(void * p) } void myIocp::OnAccept(SOCKET socket) { TSession *s = new TSession s->socket = socket //这里可以对连接的session进行自己的操作，例如给id找一个唯一的值 SetIoCompletionPort(socket, s) // 使连接socket与一个自定义结构体关联 } void myIocp::OnRead(void * p, char * buf, int len) { TSession *s = (TSession *)p send(s->socket, buf, len, 0) // 这里只是简单的把收到的消息返回给客户端 ... } void myIocp::OnClose(void * p) { delete p } myIoncp iocp main() { ... iocp.listen(4311) // 开始监听网络端口，等待客户端连接 ... }-A class for thread pool,basic usage below: struct TSession { SOCKET socket int id } class myIocp:public CIOCP { public: void OnRead(void* p, char* buf, int len) void OnAccept(SOCKET socket) void OnClose(void* p) } void myIocp::OnAccept(SOCKET socket) { TSession*s = new TSession s->socket = socket //here you can do something about connecti

魔力游戏伤害计算器源码c#编写，用数组进行数据存储，对经常pk的人有很大帮助-magic of the game hurt calculators source c# prepared with data storage arrays, on the regular pk be very helpful

一个屏幕保护程序-a screen saver

The C++ programming Language

约瑟夫环（Joseph）问题的一种描述是：编号为1，2，…，n的n个人按顺时针方向围坐一圈，每人持有一个密码（正整数）。一开始人选一个正整数作为报数上限值m，从第一个人开始按顺时针方向自1开始顺序报数，报到m时停止报数。报m的人出列，将他的密码作为新的m值，从它在顺时针方向的下一个人开始重新从1报数，如此下去，直至所有人全部出列为止。试设计一个程序求出出列顺序-Joseph Central (Joseph) a description of the problem is: numbered 1,2, ..., n of n individuals according to a clockwise direction around a circle, each holding a password (positive integer). The beginning of a positive integer as a candidate at a number of upper limit of m, from the first individual to embark on the clockwise direction since the beginning of the order of 1 is reported the number of stops required to report back at a few m. Those who reported m out of his password as the new value of m, in a clockwise direction from the next person to start off again from the 1, and so on, until all that out until all. Try to design a procedure to derive the column order

这是一个图书销售的java程序，按不同的销售模式分为五种方法，可以使销售图书时操作简单。-This is a java program book sales, according to a different sales model is divided into five kinds of method to sell your books easy to operate.

这是我做的信息论的3实验程序 （1、l-d编码 2、哈夫曼编码 3、维吉尼亚密码）-This my information, so the three experiments (1, l-d code 2, 3 Huffman coding, Virginia password)