Dialog自适应屏幕分辨率

Diffie Hellman密钥交换Diffie-Hellman密钥交换（DH）[nb的1是交换加密密钥的具体方法。它是领域ofcryptography内实现密钥交换的最早实际的例子之一。的Diffie-Hellman密钥交换方法允许双方有互相的先验知识，共同建立一个共享的密钥在不安全communicationschannel。这个密钥可以被用于使用对称密钥密码随后的通信进行加密。

One of the world-wide cooperative computing tasks is the "Grand Internet Mersenne Prime Search" -- GIMPS -- striving to find ever-larger prime numbers by examining a particular category of such numbers. A Mersenne number is defined as a number of the form (2p–1), where p is a prime number -- a number divisible only by one and itself. (A number that can be divided by numbers other than itself and one are called "composite" numbers, and each of these can be uniquely represented by the prime numbers that can be multiplied together to generate the composite number — referred to as its prime factors.) Initially it looks as though the Mersenne numbers are all primes. Prime Corresponding Mersenne Number 2 4–1 = 3 -- prime 3 8–1 = 7

这个也是单纯性算法程序，可以与NM算法比较优劣。-This is a simple algorithm procedures, NM algorithm can be compared with the pros.

算法，图论，dfs，新人，算法，图论，dfs，新人算法，图论，dfs，新人算法，图论，dfs，新人算法，图论，dfs，新人算法，图论，dfs，新人算法，图论，dfs，新人算法，图论，dfs，新人算法，图论，dfs，新人算法，图论，dfs，新人算法，图论，dfs，新人

应用背景基于MFC的2D 游戏开发技术。。。代码利用c++解决了怪物碰撞后的具体实现，，关键技术采用visual studio 2010开发的 mfc游戏中的 关键技术 怪物碰撞处理

单纯形法解决线性规划问题!!! 有过程！-Simplex method to solve linear programming problems!!! A process!

是c/c++编写的一个算法程序，在VC6.0里执行该程序之后，会显示年月日，并且该年月日是当天的时间，对于c/c++的编写有一定的参考性，可以以此为基础进行其他程序的移植。

gauss-seidel迭代法解Ax=b的解-Gauss- Seidel iterative method for Ax = b Solution

Floyed算法void floyed(void)// a[i][j]表示结点i到结点j的最短路径长度，初始时值为的权值。{for(int k=1;k

行编辑算法：可将输错的单个字符删除，也可将又错误的一行字符删除。操作简便。用栈来实现上述功能。-line editor algorithm : can be wrong deletion of a single character, and it can also wrong to delete his characters. Easy to operate. Stack used to achieve the above functions.