fengye0506的专栏

“八皇后”问题归朔法求解。八皇后问题是一个古老而著名的问题，该问题是十九世纪著名的数学家高斯1850年提出：在8X8格的国际象棋上摆放八个皇后，使其不能互相攻击，即任意两个皇后都不能处于同一行、同一列或同一斜线上，问有多少种摆法。 高斯认为有76种方案。1854年在柏林的象棋杂志上不同的作者发表了40种不同的解，后来有人用图论的方法解出92种结果。-"8 Queen" The problem Schomburg method. 8 Queen's problem is an ancient and famous, the problem is the famous 19th century mathematician Gauss 1850 : in the 8x8 grid placed on the international chess 8 Queen's, making it unable to attack each other. that is arbitrary two Queens are not at the same trip, the same series or in the same slash and asked how many pendulum. Gaussian that 76 species program. In 1854 in Berlin on different chess magazine published by the author of 40 different solutions, Later, someone using graph theory methods to come up with 92 kinds of results.

测试可用的获取硬盘序列号和CPUID的C++代码，包含windows和linux操作系统。 注意：windows vista以上系统需要管理员权限才能获取到硬盘序列号； 做了raid0磁盘阵列的硬盘也不能获取到硬盘序列号，欢迎有相关技术的朋友可以交流下。