MapX45Setup

网上收集的常用pragma指令的用法，对于使用其他c++库很值得学习(Online collection of common usage of pragma directives for the use of other c++ Library is worth learning)

远程控制服务端，功能很全,是注册系统服务来实现的，不过这个服务现在已经不用了，大家可以作为参考。(Remote control of server-side, functional whole, the registry service to achieve, but the service is now not everyone can be used as a reference.)

Vc++中，MFC中实现数据库的实时显示以及增加和删除(To increase the database to delete in MFC)

VC非常好的表格控件。初学Beginners must see者必看，很经典的。(VC a very good form control...Beginners must seeBeginners must see)

圆度误差分离界面 双通道 模拟数据输入 (Roundness error separation simulation data input interface)

在C++编程环境下，实现MIDI音乐的播放功能，可以用来学习简单的多媒体编程。(In the C++ Programming environment, realize MIDI music playback functions, can be used to study a simple multi-media programming.)

上网限制：通过添加应用程序黑白名单，禁止或者允许学生机访问指定的网址。(Internet Restrictions: black list by adding an application to prohibit or allow students to access the specified URL.)

利用IPAM模块，实现数据数字量和模拟量的采集(aciqre the digital and analog information based on IPAM.)

《VC++网络通信编程实例案例精选》源代码_第三部分("VC network communications programming examples selected cases" source code _ the third part)

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.)