c++ 高质量编程指南，适合c++初级人员向高质量编程的提高

Introduction to Open Source Library Management Systems Edward M. Corrado Rider University Libraries ecorrado@library.rider.edu

给予汇编语言的程序设计代码 用于微型计算机原理的学习与实验-given assembly language programming code for micro-computer learning theory and experiment

Windows Vista Resource Kit

#define GDIPVER 0x0110 //定义高版本的GDI+(1.1) #include #include #include #include #include #pragma comment(lib,"GdiPlus.lib") using namespace Gdiplus; #include #pragma comment(lib,"dwmapi.lib") //Aero效果是否已启用 BOOL IsCompositionEnabled() { BOOL bEnabled,bResult; bResult = (SUCCEEDED(DwmIsCompositionEnabled(&bEnabled)) && bEnabled); return bResult; } //对已分层的窗口启动玻璃效果 HRESULT EnableBlurBehindWindow(HWND hWnd, //窗口句柄 BOOL bEnable = TRUE, //启用或禁用 HRGN hRgn = 0, //模糊窗体中某个区域 BOOL bTransitionOnMaximized = FALSE) //最大化时是否启用 { DWM_BLURBEHIND blurBehind = { 0 }; blurBehind.dwFlags = DWM_BB_ENABLE | DWM_BB_TRANSITIONONMAXIMIZED; blurBehind.fEnable = bEnable; blurBehind.fTransitionOnMaximized = bTransitionOnMaximized; if (bEnable && hRgn != NULL) { blurBehind.dwFlags |= DWM_BB_BLURREGION; blurBehind.h

提供了用将文本文件导入excel的一个d-Provided with the text file into excel as a d

此代码是用C++编写的，通过建立工程的方法来求一个数的阶乘。适合初学c++者！-This code is used C++ Prepared, through the establishment of engineering methods to seek a number of factorial. Suitable for beginners c++ De!

c#下操作csv文件，后保存excel文件-operate under csv document after document preservation excel

STM32实时显示时间，在串口屏显示，高效简洁，年月日时分秒都可分别显示，通过中断方式，程序简单明了，初学者即可读懂应用

检测，列举进程，挺好用的。-detection, the process outlined, very good use.

0-l背包问题是子集选取问题。一般情况下，0-1背包问题是NP难题。0-1背包 问题的解空间可用子集树表示。解0-1背包问题的回溯法与装载问题的回溯法十分类 似。在搜索解空间树时，只要其左儿子结点是一个可行结点，搜索就进入其左子树。当 右子树有可能包含最优解时才进入右子树搜索。否则将右子树剪去。设r是当前剩余 物品价值总和；cp是当前价值；bestp是当前最优价值。当cp+r≤bestp时，可剪去右 子树。计算右子树中解的上界的更好方法是将剩余物品依其单位重量价值排序，然后 依次装入物品，直至装不下时，再装入该物品的一部分而装满背包。由此得到的价值是 右子树中解的上界。-0-l knapsack problem is selected subset of the problem. Under normal circumstances, 0-1 knapsack problem is NP-hard. 0-1 knapsack problem the solution space available subset of the tree said. Xie 0-1 knapsack problem with the law retroactively loading the retroactive law very similar. The search solution space trees, as long as their son left node is a viable nodes, the search entered its left subtree. When the right subtree is the optimal solution may contain only son into the right tree search. It will cut right subtrees. Suppose that r is the total value of the remaining items; Cp is the current value; Bestp is currently the best value. When cp r bestp, they can cut right subtrees. Calculation right