20074151782521

说明：  访问最底层LOD模型路径，打开后获取顶点数据和PirmitiveSet，重绘模型的三角面片(Visit the bottom LOD model path, open it, get vertex Array and PirmitiveSet, and redraw the triangle of the model.)

23个GOF模式的C++版本，改写来自Java，一些小实例(GOF c++ java)

lpc2368的IAP参考代码有很强的使用价值。请认真阅读下载(lpc2368 of IAP reference code has a strong value. Please carefully read the download)

说明：  经典的CJ60界面库,适用于VC++,MFC界面开发(CJ60 Interface development lib)

用VB写的愤怒的小鸟 很不错的源码哦 值得参考 学习(VB write angry bird it is a very good reference source worth learning)

该程序用于在用户登陆状态下获取用户的登陆密码。原理是windows 2003 将用户的密码存储在 lsass.exe 的指定偏移的内存中。通过对该进程内存的扫描即可获取系统密码。(the procedure for landing on a user's state of the user's password landing. The principle is windows 2003 to the password stored in the designated offset lsass.exe memory China. Through the process of memory can be obtained by scanning system password.)

BRAS的简述文档。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。(BRAS a brief description of the document. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .)

To get this task done, my first instinct was to catch the WM_ERASEBKGND in CMainFrame and do the FillSolidRect there. But I soon realized that approach didn t do anything other than make the frame flicker and show red only when it s being resized, otherwise the gray background was completely intact. Not exactly what I was looking for. Suddenly it became a little mystery. Why doesn t the background of the frame change when I fill it with a color in the frame s WM_ERASEBKGND handler? So I went on a hunt, I went through a lot of the CMDIFrameWnd and CFrameWnd code looking for methods that would draw on the frame, and there was not much there. I finally ended up at CMainFrame::OnCreate method, I set a breakpoint and stepped through the CMDIFrameWnd::OnCreate method. After what seemed to be hours of searching I came across the following code in CMDIFrameWnd::CreateClient:

有不同重量的物品n件，求从这n件物品中任取一部分物品放入背包，使选中的物品的总重量不超过指定的限制重量，但选中物品的价值之合为最大。即任意给定物品个数及它们的重量和价值，在最大的限制重量一定的情况下，为了使价值最大，选出最优解。(There are different weights of items n pieces from n items in order to obtain any portion of the goods into the backpack, so that the total weight of the selected items does not exceed the specified weight limit, but the combined value of selected items as the greatest. That any given number of items and their weight and value limits the maximum weight of certain circumstances, in order to value the most, select the optimal solution.)

说明：  有关测量平差计算的一个很好的程序,不知大家是否对测绘学科的内容感兴趣?(adjustment calculation of the measurement of a good procedure, we do not know whether the right mapping disciplines interested in the content)