485373

树形控件，可以插入头像，利用该控件可以实现类似QQ好友列表的功能(Tree class, it can show img at every item,you can use it to make friends list box like QQ)

MFC的多模板使用,一起添加类似Visual的StartPage(More templates using MFC, add together similar Visual StartPage)

vpn拨号C源码，找你很久才找到的，不知道能否用，(vpn dailer c source code)

非常经典的C++编码规范，可供项目组参考使用 (The encoding specification very classic C++ available for the project team reference)

说明：  skin5.0 界面库,很不错的皮肤类，简单的一句代码就可以让你的程序更换皮肤(skin5.0 interface library, it is a good skin type, a simple code can make your skin replacement procedures)

通过MFC的操作进行图形的操作,可以让进行简单图形绘制(through MFC to realise some functions)

windows.net下实现的QSort算法，可以正确使用，并放心下载(windows.net achieved under QSort algorithm, can be the proper use of, and rest assured Download)

NDIS 6中间层过滤驱动实现源代码，实现功能为网速限制，实现算法为漏桶算法。(NDIS 6 middle layer filter driver source code, to achieve the function of the speed limit, for the leaky bucket algorithm algorithm.)

说明：  手机游戏连连看,希望可以对大家有所帮助,(Mobile games Lianliankan, I hope it can be helpful to everyone.)

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