vmulti-master

visual c++ code to read a tiff file.

visual C++ .NET 开发精典实例 ， PDF书(visual C++. NET development classics examples, PDF Book)

黑客强大源码，黑客强大源码，黑客强大源码，黑客强大源码，黑客强大源码，黑客强大源码(Hackers powerful source code, hacking powerful source code, hacking powerful source code, hacking powerful source code, hacking powerful source code, hacking powerful source)

M-Tree (P.Ciaccia VLDB’1997) VA-File (R. Weber VLDB’1998) Pyramid-Tree(S.Berchtold SIGMOD’1998) hybrid-Tree(K.Chakrabarti ICDE’1999) A-Tree (Y. Sakurai VLDB’2000) IQ-Tree (S. Berchtold ICDE’2000) (M-Tree (P. Ciaccia VLDB 1997) VA-File (R. Weber VLDB 1998) Pyramid-Tree (S. Berchtold SIGMOD 1998) hybrid-Tree (K. Chakrabarti ICDE 1999) A-Tree (Y. Sakurai VLDB 2000) IQ-Tree (S. Berchtold ICDE 2000))

编制程序，监控网络，捕获一段时间内网络上的IP数据包，按IP数据包的源地址统计出该源地址在该时间段内发出的IP包的个数，将其写入日志文件中或用图形表示出来（建议用图形表示出统计结果）。(Program monitoring network, a period of time to capture IP data packets on the network, according to the source address of the IP packet statistics of the number of the source address is issued in the time of the IP package, written into the log file or graph out (that show the statistical results with graphics).)

cookie注入工具cookie注入工具

用MFC向导创建对话框应用程序，实现整数运算器，在对话框中进行加减乘除运算(Use the MFC application wizard to create dialog, the realization of integer arithmetic unit, operation in the dialog for addition, subtraction, multiplication, and division)

删除指定目录下某种类型的文件，VC++精选编程源码，很好的参考资料。(Delete the specified file is a type of directory, VC++ select programming source code, a good reference.)

倒计时设计 单片机 武汉理工大学 课程设计 (daojishi)

poj 3941 Hideyuki is allowed by his father Ujisato some 1000 yen bills every month for his pocket money. In the first day of every month, the number of bills is decided as follows. Ujisato prepares n pieces of m-sided dice and declares the cutback k. Hideyuki rolls these dice. The number of bills given is the sum of the spots of the rolled dice decreased by the cutback. Fortunately to Hideyuki, Ujisato promises him to give at least one bill, even if the sum of the spots does not exceed the cutback. Each of the dice has spots of 1 through m inclusive on each side, and the probability of each side is the same. In this problem, you are asked to write a program that finds the expected value of the number of given bills. (poj 3941 Hideyuki is allowed by his father Ujisato some 1000 yen bills every month for his pocket money. In the first day of every month, the number of bills is decided as follows. Ujisato prepares n pieces of m-sided dice and declares the cutback k. Hideyuki rolls these dice. The number of bills given is the sum of the spots of the rolled dice decreased by the cutback. Fortunately to Hideyuki, Ujisato promises him to give at least one bill, even if the sum of the spots does not exceed the cutback. Each of the dice has spots of 1 through m inclusive on each side, and the probability of each side is the same. In this problem, you are asked to write a program that finds the expected value of the number of given bills.)