安装盘制作源码

&它很蠢，不说英语。

微软 .NET 框架中可以定义托管类事件并用委托和 += 操作符处理这些事件。这种机制似乎很有用，那么在本机 C++ 中有没有办法做同样的事情？ -Microsoft.NET framework can be defined category of custody with the incident and commissioned = operator and handling of these incidents. This mechanism appears to be useful, then in the plane C is not able to do the same thing?

本程序针对约瑟夫问题的描述：编号为12，……n的n个人按顺时针方向围成一圈，每人持有一个密码（正整数），一开始任选一个正整数作为报数上限值m，从第一个人开始按顺序时针方向自1开始顺序报数，报道m时停止报数，报m的人处列将他的密码作为新的m值，从他在顺时针方向上的下一个人开始重新从1报数，如此下去，直至所有人全部出列为止。利用单向循环链表存储结构模拟此过程，按照出列的顺序印出各人的编号。 演示程序以用户和计算机的对话方式执行，即在计算机终端上显示“提示信息”下，用户输入循环人数n和每人的密码。-This procedure description specifically for Joseph problem: The serial number is 12, ... The n n individual surrounds the ready-made one circle according to the clockwise sense , each person holds (positive integer) a password, one positive integer beginning to assume a post of selections is upper limits ms numbering off, direction starts the hour hand beginning from the first people according to order from 1 numbering off in proper order , stop numbering off when reporting m, the person place column reporting m looks on his password as new m value , the individual begins to number off again from 1 , getting down like this from his time as soon as going ahead in clockwise sense, until proprietor all till leaving self s place in the ranks.

可以根据本机的IP及掩码信息判断本机所在的网络，然后根据这些信息查找本网络里的主机，关查找其共享资源，并可以直接双击打开-obtain the local network informaton by the host s ip address and mask,the you can search all hosts in the lan, then you may get the shared resources by double-clicking.

很多的模块，以获取有关 windows 操作系统中的文件信息之一。它有一个图形化的界面。能够使用文件流。原本作研究，但遗憾的是一直没有未完成直到结束。有兴趣的人可以继续:)

用较为真实的散点数据，根据逐步订正相关原理，对网格点的模拟数据进行修正，得到一个与真实场更为吻合的空间网格分布场。-To more real scattered point data, according to gradually revise the relevant principles of the grid points of analog data be revised to be a much more consistent with the real space field distribution of the grid field.

与搜索和截获命令APDU一起工作的嗅探器智能卡

遗传算法是基于达尔文进化论的一种智能优化算法,一种可用于复杂系统优化的具有鲁棒性的搜索算法，适用于解决传统方法难以解决的复杂的、非线性问题，可广泛应用于组合优化、离散优化、工程优化等领域。旅行商问题是一种NP难的组合优化问题，具有重要的理论研究价值和实际应用背景。然而，传统遗传算法中存在有不足，需要提出新的改进的遗传算法，并应用于旅行商问题的求解。-Genetic algorithm is based on Darwin" s theory of evolution of an intelligent optimization algorithm, a complex system can be used to optimize the robustness of the search algorithm, the application of traditional methods to solve difficult and complex, nonlinear problems, can be widely used in combination optimization, discrete optimization, engineering, optimization and other fields. Traveling Salesman Problem is a NP hard combinatorial optimization problem, has important theoretical value and practical application of research background. However, the traditional genetic algorithm, there is less than the need to introduce new improved genetic algorithm, and applied for solving the traveling salesman problem.

在关闭文件前提示的是否关闭保存-It can ask you wheather you really want to close this file or save it before close.

这个试圆周率的Machin算法，在这里共享，希望对大家有所帮助，看看这个算法会有启发！-test the ratio of the circumference Machin algorithm, in sharing, we want to help, look at this algorithm will be inspired!